Edmonds–Karp augmenting-path algorithm
Starting with zero flow, find a shortest residual s–t path by breadth-first search and augment by its minimum residual capacity, updating forward and reverse capacities.
Key knowledge
Starting with zero flow, find a shortest residual s–t path by breadth-first search and augment by its minimum residual capacity, updating forward and reverse capacities. When no path remains the flow is maximum. The algorithm uses O(VE²) arithmetic operations, independent of capacity magnitudes.
Conditions and scope
- Use finite nonnegative capacities and exact arithmetic for this operation bound.
- Choosing arbitrary augmenting paths instead of shortest paths loses this bound; rounding needs separate feasibility handling.
Sources · 1
References
Sources retain their recorded scope. A source link alone does not establish verification of every statement.
Evidence and review
Lecture 13 residual augmentation and Proposition 13.4 (Edmonds–Karp), followed by Theorem 13.7.
2026-10-10 · Independent AI editorial review: All241 compact claims, hypotheses, displayed equations/conventions and all596 origin semantic links read; entire241-entry author exact-source inspection matrix and declared limitations reviewed. Prior105 actual inherited Mathematics/Information records read for whole-inventory breadth. Targeted independent primary sections are listed below; this does NOT claim every cited source body or every proof was independently re-read. This is AI reference-content review, not human disciplinary certification, exhaustive textbook reproduction or experimental replication. Receipt: mathematics-information-independent-content-review.1.
Entry details
Permanent link to this entry ↗- Record identity
- info-edmonds-karp-flow
- Revision
- university-core.1
- Structured reference record
- University core expansion