If flow network G has flow f, augmenting path p in Gf, and , then f' is a flow in G with value .
So, keep adding augmenting paths until there are no more.
Theorem 27.2
f is a maximum flow in G if and only if residual network Gf has no augmenting paths.