In
computer science, in the field of
graph theory, the
Edmonds-Karp algorithm is an implementation of the
Ford-Fulkerson algorithm except that the computation of the shortest augmenting path is a
breadth-first search.
The Edmonds-Karp algorithm runs in O(VE2) time, where V and E is the number of vertices and edges in a graph, respectively.