Augment! network flows · ALG 14.1–14.2

Push as much flow as you can from the source z to the sink s, then prove it is maximum by finding a cut with the same capacity. Find augmenting paths in the residual network, where r(uv) = c(uv) − f(uv) + f(vu). Click z, then the next vertices of the path one by one. Click the last vertex again to take it back.