Content deleted Content added
m compu-stub (needs an example implementation) |
m moved words |
||
Line 1:
In [[computer science]], in the field of [[graph theory]], the '''Edmonds-Karp algorithm''' is an implementation of the ''[[Ford-Fulkerson algorithm]]''. The important additional feature is that the shortest augmenting path is used at each step, which guarantees that the computation will terminate. In most implementations, the shortest augmenting path is found using [[breadth-first search]].
The Edmonds-Karp algorithm [[Big O notation|runs]] in O(VE<sup>2</sup>) time, where V
{{compu-stub}}
| |||