Concepts2
⚙️AlgorithmAdvanced
Minimum Cost Maximum Flow
Minimum Cost Maximum Flow (MCMF) finds the maximum possible flow from a source to a sink while minimizing the total cost paid per unit of flow along edges.
#minimum cost maximum flow#successive shortest augmenting path#reduced cost+11
⚙️AlgorithmAdvanced
Johnson's Algorithm
Johnson's Algorithm computes all-pairs shortest paths on sparse graphs by first removing negative edges via reweighting, then running Dijkstra from every vertex.
#johnson's algorithm#all pairs shortest paths#apsp+12