This repository is no longer maintained.

AStar finds the A*-shortest path from s to t in g using the heuristic h.

BellmanFordFrom returns a shortest-path tree for a shortest path from u to all nodes in the graph g, or false indicating that a negative cycle exists in the graph.

DijkstraAllPaths returns a shortest-path tree for shortest paths in the graph g.

DijkstraFrom returns a shortest-path tree for a shortest path from u to all nodes in the graph g.

Dominators returns all dominators for all nodes in g.

FloydWarshall returns a shortest-path tree for the graph g or false indicating that a negative cycle exists in the graph.

JohnsonAllPaths returns a shortest-path tree for shortest paths in the graph g.

Kruskal generates a minimum spanning tree of g by greedy tree coalescence, placing the result in the destination, dst.

NullHeuristic is an admissible, consistent heuristic that will not speed up computation.

PostDominators returns all post-dominators for all nodes in g.

Prim generates a minimum spanning tree of g by greedy tree extension, placing the result in the destination, dst.

UniformCost returns a Weighting that returns an edge cost of 1 for existing edges, zero for node identity and Inf for otherwise absent edges.

AllShortest is a shortest-path tree created by the DijkstraAllPaths, FloydWarshall or JohnsonAllPaths all-pairs shortest paths functions.

Shortest is a shortest-path tree created by the BellmanFordFrom or DijkstraFrom single-source shortest path functions.

HeuristicCoster wraps the HeuristicCost method.

UndirectedWeighter is an undirected graph that returns edge weights.

UndirectedWeightLister is an undirected graph that returns edge weights and the set of edges in the graph.

Heuristic returns an estimate of the cost of travelling between two nodes.

Weighting is a mapping between a pair of nodes and a weight.