Algoteka

Primal-Dual Min-Cost Max-Flow Algorithm - All languages

Problem by oml1111

Problem description:

Implement the primal-dual algorithm for finding minimum cost max-flow. Construct a flow network and output the value of the min-cost max-flow on it.

Minimum Cost Flow Part Two: Primal-Dual Algorithm - topcoder.com
Flow network - wikipedia.org

Verified languages:

# Language Count
1 C++ 1

Unverified languages:

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