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

Wheatley Heights, New York

... town the population is spread out with 30.3% under the age of 18, 8.1% from 18 to 24, 29.9% from 25 to 44, 23.8% from 45 to 64, and 7.9% who are 65 years of age or older. ...