-
Notifications
You must be signed in to change notification settings - Fork 1
Algorithm
Katya Prusakova edited this page Jun 7, 2021
·
1 revision
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 displaystyle (|V||E|^2) time.
The path found must be a shortest path that has available capacity. This can be found by a breadth-first search, where we apply a weight of 1 to each edge.