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.
Geek Repo:Geek Repo
Github PK Tool:Github PK Tool
