Uses of Class
org.geotools.graph.traverse.basic.AbstractGraphIterator

Packages that use AbstractGraphIterator Package Description org.geotools.graph.traverse.basic org.geotools.graph.traverse.standard 

Uses of AbstractGraphIterator in org.geotools.graph.traverse.basic
Subclasses of AbstractGraphIterator in org.geotools.graph.traverse.basic Modifier and Type Class Description class
SourceGraphIterator
A GraphIterator that starts iteration from a specefied point. 
Uses of AbstractGraphIterator in org.geotools.graph.traverse.standard
Subclasses of AbstractGraphIterator in org.geotools.graph.traverse.standard Modifier and Type Class Description class
AStarIterator
A path iterator that uses a function (usually denoted f(x)) to determine the order in which the algorithm visits nodes, f(x) is a sum of two functions: The pathcost function (usually denoted g(x), which may or may not be a heuristic) An admissible "heuristic estimate" (usually denoted h(x)).class
BreadthFirstIterator
Iterates over the nodes of a graph in a Breadth First Search pattern starting from a specified node.class
BreadthFirstTopologicalIterator
Iterates over the nodes of a graph in Breadth First Topological Sort pattern.class
DepthFirstIterator
Iterates over the nodes of a graph in a Depth First Search pattern starting from a specified node.class
DepthFirstTopologicalIterator
Iterates over the nodes of a graph in Depth First Topological Sort pattern.class
DijkstraIterator
Iterates over the nodes of a graph in pattern using Dijkstra's Shortest Path Algorithm.class
DirectedBreadthFirstIterator
class
DirectedBreadthFirstTopologicalIterator
class
DirectedDepthFirstIterator
class
DirectedDepthFirstTopologicalIterator
class
DirectedDijkstraIterator
class
NoBifurcationIterator
Iterates over the nodes of a graph starting from a specified node, stopping at a bifurcation.
