Suppose that I have run maxflow algorithm on a graph G and, as a result, I have a set of edges with flow on them.I would like to enumerate all possible sets of paths that comprise the maxflow.That is, each set of paths will make the max flow.But I suspect there could be multiple set of such paths.
Finding paths from the result of max flow
algorithms;graphs;network flow