Uses of Class
org.geotools.graph.traverse.basic.AbstractGraphIterator
Packages that use AbstractGraphIterator
-
Uses of AbstractGraphIterator in org.geotools.graph.traverse.basic
Subclasses of AbstractGraphIterator in org.geotools.graph.traverse.basicModifier and TypeClassDescriptionclass
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.standardModifier and TypeClassDescriptionclass
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 path-cost function (usually denoted g(x), which may or may not be a heuristic) An admissible "heuristic estimate" (usually denoted h(x)).class
Iterates over the nodes of a graph in a Breadth First Search pattern starting from a specified node.class
Iterates over the nodes of a graph in Breadth First Topological Sort pattern.class
Iterates over the nodes of a graph in a Depth First Search pattern starting from a specified node.class
Iterates over the nodes of a graph in Depth First Topological Sort pattern.class
Iterates over the nodes of a graph in pattern using Dijkstra's Shortest Path Algorithm.class
class
class
class
class
class
Iterates over the nodes of a graph starting from a specified node, stopping at a bifurcation.