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

View on GitHub

6 Stars

1 Forks

6 Watchers

C++ Language

78.3 SrcLog Score

Cost to Build

$502.2K

Market Value

$338.3K

How is this calculated?

Growth over time

1 data points · 2026-04-08 → 2026-04-08

Stars Forks Watchers

💬

How do you feel about this project?

Ask AI about MaximumFlowAlgorithms

Question copied to clipboard

What is the ArthurRouquan/MaximumFlowAlgorithms GitHub project? Description: "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.". Written in C++. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

How to clone MaximumFlowAlgorithms

Clone via HTTPS

git clone https://github.com/ArthurRouquan/MaximumFlowAlgorithms.git

Clone via SSH

[email protected]:ArthurRouquan/MaximumFlowAlgorithms.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the MaximumFlowAlgorithms issue tracker:

Open GitHub Issues

Similar to MaximumFlowAlgorithms

RxJava js-stack-from-scratch este Under-the-hood-ReactJS BouncyLayout flow-typed react-redux-typescript-guide reactor-core javascript-obfuscator apollo-tooling exabgp flow-dashboard eslint-plugin-flowtype SwiftLinkPreview typescript-vs-flowtype RxFlow skydive glow react-cool-starter ifme android-drag-FlowLayout redux-webpack-es6-boilerplate react-progressive-web-app graphql-code-generator react-fake-props JavaScriptEnhancements shenzhen-go eslint-plugin-flowtype-errors homer throat