Template Function ADS::dagShortestPaths

• Defined in File ShortestPaths.h

Function Documentation

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

the shortest paths of an acyclic graph, scanning its nodes in topological order, O( n + m )

Pre:

r is a node, and the graph is acyclic (audit)

Post:

the conditions of Bellman (audit)