| Package | Description |
|---|---|
| org.geotools.graph.path | |
| org.geotools.graph.traverse.standard |
| Class and Description |
|---|
| AStarIterator.AStarFunctions
Defines the functions needed by A Star.
|
| DijkstraIterator
Iterates over the nodes of a graph in pattern using Dijkstra's Shortest Path Algorithm.
|
| DijkstraIterator.EdgeWeighter
Supplies a weight for each edge in the graph to be used by the iteration when calculating
node costs.
|
| DijkstraIterator.NodeWeighter
Supplies a weight for each pair of adjacent edges.
|
| Class and Description |
|---|
| AStarIterator.AStarFunctions
Defines the functions needed by A Star.
|
| AStarIterator.AStarNode
Internal data structure used to track node costs, and parent nodes.
|
| BreadthFirstIterator
Iterates over the nodes of a graph in a Breadth First Search pattern starting from a
specified node.
|
| BreadthFirstTopologicalIterator
Iterates over the nodes of a graph in Breadth First Topological Sort pattern.
|
| DepthFirstIterator
Iterates over the nodes of a graph in a Depth First Search pattern starting from a
specified node.
|
| DijkstraIterator
Iterates over the nodes of a graph in pattern using Dijkstra's Shortest Path Algorithm.
|
| DijkstraIterator.DijkstraNode
Internal data structure used to track node costs, and parent nodes.
|
| DijkstraIterator.EdgeWeighter
Supplies a weight for each edge in the graph to be used by the iteration when calculating
node costs.
|
| DijkstraIterator.NodeWeighter
Supplies a weight for each pair of adjacent edges.
|
| DirectedBreadthFirstTopologicalIterator |
Copyright © 1996–2019 Geotools. All rights reserved.