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(VE2) 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
Canadian Charter of Rights and Freedoms

... the enumerated rights is much more general limitaton than the specific limiations in the European Convention. This general limitations clause definitely makes the Canadian ...

 
 
 
This page was created in 25.6 ms