We have seen that from the flow obtained by the
Ford and Fulkerson algorithm we can construct a cut
with capacity equal to the flow value. Therefore,
- we have given an alternative proof that the Ford
and Fulkerson algorithm yields a maximum flow
- we have shown how to construct a minimum cu