Expand description
Minimum s-t cut extracted from a completed max-flow computation. Minimum s-t cut from a completed max-flow computation.
By the Max-Flow Min-Cut theorem, the value of the maximum flow from
source s to sink t equals the capacity of the minimum cut separating
s from t. After running a max-flow algorithm, the min-cut can be read
directly from the residual graph in O(V + E).
Structs§
- MinCut
- The result of a minimum s-t cut computation.