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
⚙️AlgorithmIntermediate
Dijkstra - Variations and Applications
Dijkstra’s algorithm can be adapted to track the second shortest path by keeping the best and second-best distances per vertex.
#dijkstra#second shortest path#k shortest paths+12