Shortest path algorithms
Tree of shortest paths from a certain node to the rest of the (reachable) nodes.
dijkstra applied to a heap in which the only known node is
the starting node, with a path of length 0 leading to it.
Shortest path between two nodes.
Length of the shortest path between two nodes.
|:: (Graph gr, Real b)|
|=> Heap b (LPath b)|
Initial heap of known paths and their lengths.
|-> gr a b|
|-> LRTree b|
Dijkstra's shortest path algorithm.