MinCut
After running max-flow, the left side of a min-cut from s to t is given by all vertices reachable from s, only traversing edges with positive residual capacity.
0 lines works
content/graph/MinCut.h — Simon Lindholm, source: Wikipedia
After running max-flow, the left side of a min-cut from s to t is given by all vertices reachable from s, only traversing edges with positive residual capacity.
0 lines works
content/graph/MinCut.h — Simon Lindholm, source: Wikipedia