Too many shortest path implementations
The file distance.hh
contains several implementations of shortest path computations, which we actually call lightest path
, since we focus of the weights.
Sébastien has already generalized/implemented other algorithms to compute these shortest paths.
We should fuse them all, and keep only a single copy of them all. Obviously, each time the most efficient of each.
Simplify one by one, with performance measurements to guarantee that we kept the right one.