Module graphalgs::shortest_path

Shortest path algorithms.

Functions dijkstra, bellman_ford and astar are taken from the ‘petgraph’ crate.

Structs

NegativeCycle

An algorithm error: a cycle of negative weights was found in the graph.

Functions

astar	[Generic] A* shortest path algorithm.
bellman_ford	[Generic] Compute shortest paths from node source to all other.
dijkstra	[Generic] Dijkstra’s shortest path algorithm.
distance_map	Convert distance matrix into hashmap.
floyd_warshall	Floyd–Warshall algorithm for all pairs shortest path problem.
shortest_distances	The lengths of the shortest paths from the start vertex to all the others.