Implement the successive shortest path 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: Successive Shortest Path Algorithm - topcoder.com
5.4 Successive Shortest Path Algorithm - Network flows: theory, algorithms, and applications (Ravindra Ahuja, Thomas Magnanti, James Orlin)
Flow network - wikipedia.org
# | Language | Count |
---|---|---|
1 | C++ | 1 |
# | Language | Count |
---|---|---|
No unverified languages ... |