Iterates over the nodes of a graph starting from a specified node, stopping
at a bifurcation. A bifurcation is defined as a node of degree > 2.
The following figures illustrate examples of the iterator.
author: Justin Deoliveira, Refractions Research Inc, jdeolive@refractions.net
Method Summary
public void
cont(Graphable current, GraphTraversal traversal) Searches for the next node to be returned in the iteration.
killBranch(Graphable current, GraphTraversal traversal) Kills the current branch of the iteration by explicitly setting the next
node to be returned to null.
next(GraphTraversal traversal) The next node in the iteration is the first node found adjacent to the
current node that is non visited and of degree less than 2.
Searches for the next node to be returned in the iteration. The next node
is the first node (of two) related to the current node that is non visited
and of degree <= 2.
See Also:org.geotools.graph.traverse.GraphIterator.cont(Graphable)
The next node in the iteration is the first node found adjacent to the
current node that is non visited and of degree less than 2.
See Also:org.geotools.graph.traverse.GraphIterator.next