Max-Flow Hub
Home
Visualizer
Residual
Theorems
Complexity
Max-Flow Hub
Visualizer
Add Node
Add Edge
Set Source
Set Sink
Predefined:
Custom Graph
Simple S-T Flow
CLRS Example
Bottleneck
Multiple Paths
Algo:
FF
EK
Push-Relabel
Visualize
Reset Flow
Clear All
◀
Step 0 / 0
▶
Play
Speed
Original Flow Network
Total Flow:
0
Residual Graph
Forward = cap - flow, Backward (dashed) = flow