next up previous
Next: Ford-Fulkerson Algorithm Up: CSE 2320: Algorithms and Previous: Augmenting Paths

Corollary 27.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 27.2

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



Copyright © 1998 The University of Texas at Arlington