next up previous
Next: Up: Previous:

Corollary 26.4

If flow network G has flow f, augmenting path p in Gf, and \(f' \;=\; f \;+\; f_p\), then f' is a flow in G with value \(\mid f' \mid \;=\; \mid f \mid \;+\; \mid f_p \mid \;>\; \mid f \mid\).

So, keep adding augmenting paths until there are no more.



Theorem 26.7

f is a maximum flow in G if and only if residual network Gf has no augmenting paths.


next up previous
Next: Up: Previous: