Template Function ADS::floydWarshall

• Defined in File AllPairsShortestPaths.h

Function Documentation

template<Graph G>
AllPairs<typename G::Weight> ADS::floydWarshall(const G &g)

floydWarshall(): the shortest paths between all the pairs of nodes

Post:

the distances are closed under the triangle inequality, bounded by the edges and realized by p, unless negativeCycle (audit)