# Edmonds-Karp Maximum Flow Algorithm

Referring to Tim Roughgarden's Lecture Note - 2 (page 11) on CS261 at Stanford following statement and the para seem quite confusing.

Claim: d(f) never decreases during the execution of the Edmonds-Karp algorithm.

• It looks like you've answered why $\delta_f$ is monotonically non-decreasing. If you're wondering about the proof, CLRS is always a good resource. I would look at the Third Edition pages 727-730. – ryan May 24 '17 at 2:05