§ Min cost flow (TODO)

  1. Find max flow.
  2. Find negative cost cycle in residual graph of max flow. Push flow around the negative cost cycle.

§ Relation between max flow and min cost circulation

§ Min Cost Flow in general

§ Minimum mean cycle

§ shortest path as circulation.

§ Min cost circulation algorithms

§ References