1 repository on SrcLog
Add it to a GitHub README or profile — the card updates as the ranking changes:
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.