Module Graph__Path.Johnson
Parameters
Signature
val all_pairs_shortest_paths : G.t -> W.t HVV.t
all_pairs_shortest_paths g
computes the distance of shortest path between all pairs of vertices ing
. They are returned as a hash table mapping each pair of vertices to their distance. Ifg
contains a negative-cycle, raisesNegativeCycle l
wherel
is such a cycle.Complexity: at most O(VElog(V))