Template Function ADS::shortestPaths(const G&, int, S&, FrontierCounts *)

Function Documentation

template<Graph G, class S>
ShortestPathTree<typename G::Weight> ADS::shortestPaths(const G &g, int r, S &frontier, FrontierCounts *c = nullptr)

camminiMinimi() with the structure S given, its work in *c if given

Pre:

r is a node, S is empty; no negative cycle reachable from r unless S is first in, first out (audit)

Post:

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