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 1:10 0:109 0:10 1:10 c 2001 by Charles E Leiserson Introduction to Agorithms y© 2001 by Charles E. Leiserson Introduction to Algorithms Day 40 L23.9 Ford-Fulkerson max-flow algorithm Can be slow: ss tt 1:109 0:109 1:109 1:1 0:109 G: 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)