Academical implementation of Edmonds-Karp algorithm in O(nm²) and Dinitz (Dinic) algorithm O(n²m) for computing the maximum flow of a flow network.
flow
graph
flownetwork-algorithms
maximum-flow
cpp20
edmonds-karp-algorithm
flownetwork
dinic-algorithm
maximum-flow-solver
graphs-algorithms
maximum-flow-algorithm
edmonds-karp
-
Updated
Jul 4, 2021 - C++