Template Function ADS::edgeDisjointPaths

• Defined in File FlowApplications.h

Function Documentation

template<Graph G>
std::vector<std::vector<int>> ADS::edgeDisjointPaths(const G &g, int s, int t, long long k = std::numeric_limits<long long>::max())

edgeDisjointPaths(): at most k paths from s to t with no edge in common, as many as there can be, each as its nodes from s to t

Pre:

s and t are distinct nodes, k >= 0

Post:

at most k simple paths from s to t along the edges of the graph, no edge used twice (audit)