Encyclopedia > E > Edmonds-Karp algorithm
Edmonds-Karp algorithm
In computer science and graph theory, the Edmonds-Karp algorithm is an implementation of the Ford-Fulkerson method for computing the maximum flow in a flow network in O(VE^2). It is asymptotically slower than the relabel-to-front algorithm, which runs in O(V^3), but it is often faster in practice for sparse graphs.
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)