Uses of Interface
org.geotools.graph.traverse.GraphIterator
-
Packages that use GraphIterator Package Description org.geotools.graph.traverse org.geotools.graph.traverse.basic org.geotools.graph.traverse.standard org.geotools.graph.util.graph -
-
Uses of GraphIterator in org.geotools.graph.traverse
Methods in org.geotools.graph.traverse that return GraphIterator Modifier and Type Method Description GraphIterator
GraphTraversal. getIterator()
Returns the iterator that specifies the order in which to visit graph components.Methods in org.geotools.graph.traverse with parameters of type GraphIterator Modifier and Type Method Description void
GraphTraversal. setIterator(GraphIterator iterator)
Sets the iterator that specifies the order in which visit graph components. -
Uses of GraphIterator in org.geotools.graph.traverse.basic
Classes in org.geotools.graph.traverse.basic that implement GraphIterator Modifier and Type Class Description class
AbstractGraphIterator
An abstract implementation of GraphIterator.class
SourceGraphIterator
A GraphIterator that starts iteration from a specefied point.Methods in org.geotools.graph.traverse.basic that return GraphIterator Modifier and Type Method Description GraphIterator
BasicGraphTraversal. getIterator()
Methods in org.geotools.graph.traverse.basic with parameters of type GraphIterator Modifier and Type Method Description void
BasicGraphTraversal. setIterator(GraphIterator iterator)
Sets the iterator and intializes it.Constructors in org.geotools.graph.traverse.basic with parameters of type GraphIterator Constructor Description BasicGraphTraversal(Graph graph, GraphWalker walker, GraphIterator iterator)
Constructs a new graph traversal.StagedGraphTraversal(Graph graph, GraphWalker walker, GraphIterator iterator)
-
Uses of GraphIterator in org.geotools.graph.traverse.standard
Classes in org.geotools.graph.traverse.standard that implement GraphIterator 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 path-cost 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. -
Uses of GraphIterator in org.geotools.graph.util.graph
Methods in org.geotools.graph.util.graph that return GraphIterator Modifier and Type Method Description protected GraphIterator
CycleDetector. createIterator()
Creates the iterator to be used in the cycle detection.protected GraphIterator
DirectedCycleDetector. createIterator()
-