Edmonds–Karp algorithm

In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, the Edmonds–Karp algorithm is an implementation of the <a href="/facts/Ford%25E2%2580%2593Fulkerson_algorithm/wwk3tw52">Ford–Fulkerson method</a> for computing the <a href="/facts/Maximum_flow_problem/aSal0FGF">maximum flow</a> in a <a href="/facts/Flow_network/k0LCoRwD">flow network</a> in <a href="/facts/Big_O_notation/weFFjSWg">
 
 
 
 O
 (
 
 |
 
 V
 
 |
 
 
 |
 
 E
 
 
 |
 
 
 2
 
 
 )
 
 
 {\displaystyle O(|V||E|^{2})}
 
</a> time. The algorithm was first published by <a href="/facts/Yefim_Dinitz/edDMBnpt">Yefim Dinitz</a> in 1970, and independently published by <a href="/facts/Jack_Edmonds/4bLnep3e">Jack Edmonds</a> and <a href="/facts/Richard_Karp/XtYCL0nA">Richard Karp</a> in 1972. <a href="/facts/Dinic%2527s_algorithm/n8yqcENs">Dinitz's algorithm</a> includes additional techniques that reduce the running time to 
 
 
 
 O
 (
 
 |
 
 V
 
 
 |
 
 
 2
 
 
 
 |
 
 E
 
 |
 
 )
 
 
 {\displaystyle O(|V|^{2}|E|)}
 
.

The Wikibook Algorithm implementation has a page on the topic of: Edmonds-Karp

Edmonds–Karp algorithm open-in-new

Edmonds–Karp algorithm