Template Function ADS::dagLongestPaths(const G&, Keep&&)

Function Documentation

template<Graph G, class Keep>
std::vector<PathLength<G>> ADS::dagLongestPaths(const G &g, Keep &&keep)

dagLongestPaths(): the largest total length of a path leaving each node along the edges ( u , v ) with keep( u , v ), the empty path included, 0 on the names that are not nodes

Pre:

the edges kept make no cycle

Post:

L[ u ] >= w( u , v ) + L[ v ] on each edge kept, and each L[ u ] is 0 or reached by one of them (audit)