Skip to content
/ MaximumFlowAlgorithms Public

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.

5 stars 1 fork Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

ArthurRouquan/MaximumFlowAlgorithms

Error
Looks like something went wrong!

About

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.

Topics

flow graph flownetwork-algorithms maximum-flow cpp20 edmonds-karp-algorithm flownetwork dinic-algorithm maximum-flow-solver graphs-algorithms maximum-flow-algorithm edmonds-karp

Resources

Readme
Activity

Stars

5 stars

Watchers

1 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published

Languages