#

maximum-flow-solver

Here is 1 public repository matching this topic...

ArthurRouquan / MaximumFlowAlgorithms

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++

Improve this page

Add a description, image, and links to the maximum-flow-solver topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the maximum-flow-solver topic, visit your repo's landing page and select "manage topics."