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.
-
Updated
Jul 4, 2021 - C++
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.
Given the standings in a sports league at some point during the season, determine which teams have been mathematically eliminated from winning their division.
Network-flows: a c++ command line tool for network optimization problems
💧 | A real-world application of the Edmonds-Karp algorithm for optimizing a water management system
Design of Algorithms course first project
Add a description, image, and links to the edmonds-karp topic page so that developers can more easily learn about it.
To associate your repository with the edmonds-karp topic, visit your repo's landing page and select "manage topics."