Edmonds–Karp algorithm
Algorithm to compute the maximum flow in a flow network / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Edmonds–Karp algorithm?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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 time. The algorithm was first published by Yefim Dinitz in 1970,[1][2] and independently published by Jack Edmonds and Richard Karp in 1972.[3] Dinitz's algorithm includes additional techniques that reduce the running time to .[2]
The Wikibook Algorithm implementation has a page on the topic of: Edmonds-Karp
It has been suggested that this article be merged into Ford–Fulkerson algorithm. (Discuss) Proposed since April 2024. |