Template Function ADS::shortestPaths(const G&, int, Frontier)

• Defined in File ShortestPaths.h

Function Documentation

template<Graph G>
ShortestPathTree<typename G::Weight> ADS::shortestPaths(const G &g, int r, Frontier how)

camminiMinimi(): the shortest paths from r with the structure how

Pre:

r is a node; no negative cycle reachable from r unless how is QUEUE (audit)

Post:

the conditions of Bellman, unless a negative cycle was found (audit)