Interface Summary Interface Description DijkstraIterator.EdgeWeighterSupplies a weight for each edge in the graph to be used by the iteration when calculating node costs. DijkstraIterator.NodeWeighterSupplies a weight for each pair of adjacent edges.
Class Summary Class Description 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)). AStarIterator.AStarFunctionsDefines the functions needed by A Star. AStarIterator.AStarNodeInternal data structure used to track node costs, and parent nodes. BreadthFirstIteratorIterates over the nodes of a graph in a Breadth First Search pattern starting from a specified node. BreadthFirstTopologicalIteratorIterates over the nodes of a graph in Breadth First Topological Sort pattern. DepthFirstIteratorIterates over the nodes of a graph in a Depth First Search pattern starting from a specified node. DepthFirstTopologicalIteratorIterates over the nodes of a graph in Depth First Topological Sort pattern. DijkstraIteratorIterates over the nodes of a graph in pattern using Dijkstra's Shortest Path Algorithm. DijkstraIterator.DijkstraNodeInternal data structure used to track node costs, and parent nodes. DirectedBreadthFirstIterator DirectedBreadthFirstTopologicalIterator DirectedDepthFirstIterator DirectedDepthFirstTopologicalIterator DirectedDijkstraIterator NoBifurcationIteratorIterates over the nodes of a graph starting from a specified node, stopping at a bifurcation.