Boost MinCut from MaxFlow

Question

I need to get an st-MinCut of a graph. I recently started using the C++ Boost libraries, which don't seem to have that st-MinCut functionality, but the do have MaxFlow implementations and I can (in theory) make use of the MaxFlow/MinCut duality.

I have gotten the "push relabel max flow" function working properly, but I can't figure out how to run a DFS, from the source along edges where the residual capacity are greater than 0, to get the nodes on the source side.

Thanks in advance.

Answer 1

You can use filtered_graph to create a (virtual) graph that only has the edges with non-zero residual capacity (or any other criteria)