Skip to content

← Lab · Chapter: Minimum cost flow

Minimum cost flow: cycle canceling and successive shortest paths

The residual network with costs, the negative cycle and its augmentation, or the shortest paths on the reduced costs; at the end the potentials certificate. Choose the algorithm (and, for cycle canceling, the initial flow); ◀ ▶ one step at a time, «Run» to watch them all; the «Instance» menu, «Random», «Edit…» (arcs i-j:u,c) and «Balances…» change the network.