Algoteka

Dinic's Algorithm - All languages

Problem by oml1111

Problem description:

Implement the Dinic's max-flow algorithm. Construct some example flow network and find the maximum-flow on it.

Dinic's algorithm - wikipedia.org
Flow network - wikipedia.org

Verified languages:

# Language Count
1 C++ 1

Unverified languages:

# Language Count
No unverified languages ...
View problem discussion (0 comments)