Package org.geotools.graph.traverse.standard

Interface Summary

Interface	Description
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 Summary

Class	Description
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)).
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.
DepthFirstTopologicalIterator	Iterates over the nodes of a graph in Depth First Topological Sort pattern.
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.
DirectedBreadthFirstIterator
DirectedBreadthFirstTopologicalIterator
DirectedDepthFirstIterator
DirectedDepthFirstTopologicalIterator
DirectedDijkstraIterator
NoBifurcationIterator	Iterates over the nodes of a graph starting from a specified node, stopping at a bifurcation.