Max-Flow Min-Cut Theorem

In any flow network the value of a maximum $s$-$t$ flow equals the capacity of a minimum $s$-$t$ cut; a flow is maximum exactly when its residual graph has no augmenting path, which is how Ford-Fulkerson finds it.