Shortest Path
Flow Sent
Saturated Edge
Residual Edge
Source/Sink
Successive Shortest Path
Finds min-cost max-flow by repeatedly sending flow along the shortest (cheapest) path. Node potentials ensure non-negative reduced costs for Dijkstra.
Finds min-cost max-flow by repeatedly sending flow along the shortest (cheapest) path. Node potentials ensure non-negative reduced costs for Dijkstra.
Example Network
Controls
Click "Step" to find shortest path and send flow
Statistics
0
Total Flow
0
Total Cost
0
Iterations
0
Avg Cost/Unit
Node Potentials