Search Java Classes and Packages
#Org.geotools.graph.traverse.standard Classes and Interfaces - 17 results found.
| Name | Description | Type | Package | Framework |
| 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: | Class | org.geotools.graph.traverse.standard | GeoTools |
| AStarIterator .AStarFunctions | Defines the functions needed by A Star. | Class | org.geotools.graph.traverse.standard.AStarIterator | GeoTools |
| AStarIterator .AStarNode | Internal data structure used to track node costs, and parent nodes. | Class | org.geotools.graph.traverse.standard.AStarIterator | GeoTools |
| BreadthFirstIterator | Iterates over the nodes of a graph in a Breadth First Search pattern starting from a specified node. | Class | org.geotools.graph.traverse.standard | GeoTools |
| BreadthFirstTopologicalIterator | Iterates over the nodes of a graph in Breadth First Topological Sort pattern. | Class | org.geotools.graph.traverse.standard | GeoTools |
| DepthFirstIterator | Iterates over the nodes of a graph in a Depth First Search pattern starting from a specified node. | Class | org.geotools.graph.traverse.standard | GeoTools |
| DepthFirstTopologicalIterator | Iterates over the nodes of a graph in Depth First Topological Sort pattern. | Class | org.geotools.graph.traverse.standard | GeoTools |
| DijkstraIterator | Iterates over the nodes of a graph in pattern using Dijkstra's Shortest Path Algorithm. | Class | org.geotools.graph.traverse.standard | GeoTools |
| DijkstraIterator .DijkstraNode | Internal data structure used to track node costs, and parent nodes. | Class | org.geotools.graph.traverse.standard.DijkstraIterator | GeoTools |
| DijkstraIterator .EdgeWeighter | Supplies a weight for each edge in the graph to be used by the iteration when calculating node costs. | Interface | org.geotools.graph.traverse.standard.DijkstraIterator | GeoTools |
| DijkstraIterator .NodeWeighter | Supplies a weight for each pair of adjacent edges. | Interface | org.geotools.graph.traverse.standard.DijkstraIterator | GeoTools |
| DirectedBreadthFirstIterator | Class | org.geotools.graph.traverse.standard | GeoTools | |
| DirectedBreadthFirstTopologicalIterator | Class | org.geotools.graph.traverse.standard | GeoTools | |
| DirectedDepthFirstIterator | Class | org.geotools.graph.traverse.standard | GeoTools | |
| DirectedDepthFirstTopologicalIterator | Class | org.geotools.graph.traverse.standard | GeoTools | |
| DirectedDijkstraIterator | Class | org.geotools.graph.traverse.standard | GeoTools | |
| NoBifurcationIterator | Iterates over the nodes of a graph starting from a specified node, stopping at a bifurcation. | Class | org.geotools.graph.traverse.standard | GeoTools |