Common
Edmonds–Karp algorithm
Algorithm to compute the maximum flow in a flow network
Edmonds–Karp algorithm
In computer science, the Edmonds–Karp algorithm is an implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in O ( | V | | E | 2 ) {\displaystyle O(|V||E|^{2})} time. The algorithm was first published by Yefim Dinitz in 1970, and independently published by Jack Edmonds and Richard Karp in 1972. Dinitz's algorithm includes additional techniques that reduce the running time to O ( | V | 2 | E | ) {\displaystyle O(|V|^{2}|E|)} .
Open boosters, collect cards and trade them. Free to play.
Play for free