Min-Cost Max Flow

Ford & Fulkerson / Busacker & Gowen, 1961

Classic successive shortest augmenting path algorithms push flow along minimum-cost residual paths. This tiny S–A/B–T network shows capacities, unit costs, and flow increasing in two schematic augmentation rounds.