Edmonds Karp Algorithm for maximum flow

graph-algorithm
maximum-flow
edmonds-karp-algorithm

(Team) #1

Reading time: 15 minutes | Coding time: 10 minutes

Edmonds–Karp algorithm is an optimized implementation of the Ford–Fulkerson method for computing the maximum flow in a flow network in O(V E^2) time instead of O(E |max_flow|) in case of Ford-Fulkerson algorithm.


This is a companion discussion topic for the original entry at http://iq.opengenus.org/edmonds-karp-algorithm-for-maximum-flow/