| Package | Description | 
|---|---|
| org.geotools.graph.traverse | |
| org.geotools.graph.traverse.basic | |
| org.geotools.graph.traverse.standard | |
| org.geotools.graph.util.graph | 
| Modifier and Type | Method and Description | 
|---|---|
| GraphIterator | GraphTraversal. getIterator()Returns the iterator that specifies the order in which to visit graph components. | 
| Modifier and Type | Method and Description | 
|---|---|
| void | GraphTraversal. setIterator(GraphIterator iterator)Sets the iterator that specifies the order in which visit graph components. | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | AbstractGraphIteratorAn abstract implementation of GraphIterator. | 
| class  | SourceGraphIteratorA GraphIterator that starts iteration from a specefied point. | 
| Modifier and Type | Method and Description | 
|---|---|
| GraphIterator | BasicGraphTraversal. getIterator() | 
| Modifier and Type | Method and Description | 
|---|---|
| void | BasicGraphTraversal. setIterator(GraphIterator iterator)Sets the iterator and intializes it. | 
| Constructor and Description | 
|---|
| BasicGraphTraversal(Graph graph,
                   GraphWalker walker,
                   GraphIterator iterator)Constructs a new graph traversal. | 
| StagedGraphTraversal(Graph graph,
                    GraphWalker walker,
                    GraphIterator iterator) | 
| Modifier and Type | Class and Description | 
|---|---|
| class  | AStarIteratorA 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  | BreadthFirstIteratorIterates over the nodes of a graph in a Breadth First Search pattern starting from a
 specified node. | 
| class  | BreadthFirstTopologicalIteratorIterates over the nodes of a graph in Breadth First Topological Sort pattern. | 
| class  | DepthFirstIteratorIterates over the nodes of a graph in a Depth First Search pattern starting from a
 specified node. | 
| class  | DepthFirstTopologicalIteratorIterates over the nodes of a graph in Depth First Topological Sort pattern. | 
| class  | DijkstraIteratorIterates 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  | NoBifurcationIteratorIterates over the nodes of a graph starting from a specified node, stopping at a bifurcation. | 
| Modifier and Type | Method and Description | 
|---|---|
| protected GraphIterator | CycleDetector. createIterator()Creates the iterator to be used in the cycle detection. | 
| protected GraphIterator | DirectedCycleDetector. createIterator() | 
Copyright © 1996–2019 Geotools. All rights reserved.