P5.1 Flows and Cuts
We found an - cut with and a flow with .
Since every flow value is at most the capacity of every - cut, we have (using the Maxflow-Mincut Theorem)
so , and is a maximum flow
We found an - cut with and a flow with .
Since every flow value is at most the capacity of every - cut, we have (using the Maxflow-Mincut Theorem)
so , and is a maximum flow