Groups
Category
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.
Dijkstra’s algorithm can be adapted to track the second shortest path by keeping the best and second-best distances per vertex.