Encyclopedia > Edmonds-Karp algorithm

Article Content

Edmonds-Karp algorithm

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(VE²) time, where V and E is the number of vertices and edges in a graph, respectively.

All Wikipedia text is available under the terms of the GNU Free Documentation License

Search Encyclopedia

Search over one million articles, find something about almost anything!

Featured Article

Charles V, Holy Roman Emperor

... Jerónimo de Yuste[?], Spain September 21, 1558) was Holy Roman Emperor (as Charles V) from 1519-1558; he was also King of Spain from 1516-1556 -- officially as Charles ...