Graph AlgorithmsMaximum Flow (Edmonds-Karp)
Maximum Flow (Edmonds-Karp)
Computes the maximum flow from source to sink by repeatedly pushing flow along shortest augmenting paths found with BFS.
Advancedgraphmax-flowresidual graphBFS augmenting paths
Loading visualization…