Path.Johnson
all_pairs_shortest_paths g
computes the distance of shortest path between all pairs of vertices in g
. They are returned as a hash table mapping each pair of vertices to their distance. If g
contains a negative-cycle, raises NegativeCycle l
where l
is such a cycle.
Complexity: at most O(VElog(V))