Ford fulkerson max-flow algorithm Algorithm: flu,v <0 for while an augmenting path p in G wrtf exists do augment f by cr(p) Can be slow c 2001 by Charles E Leiserson Introduction to Agorithms Day40L23.5© 2001 by Charles E. Leiserson Introduction to Algorithms Day 40 L23.5 Ford-Fulkerson max-flow algorithm Algorithm: f [u, v] ← 0 for all u, v ∈ V while an augmenting path p in G wrt f exists do augment f by cf(p) Can be slow: ss tt 109 109 109 1 109 G: