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
Springs, New York

... are Hispanic or Latino of any race. There are 1,924 households out of which 29.7% have children under the age of 18 living with them, 51.2% are married couples ...

 
 
 
This page was created in 21.7 ms