🌊
Ford-Fulkerson Visualizer
Maximum Flow Algorithm
☀️
Space
Step
A
Auto
R
Reset
💾
Export
⚡
Max Flow
0
🛤️
Paths Found
0
⏱️
Runtime
0
ms
📊
Density
0
%
📚
Preset Graphs
Simple
Medium
Complex
Dense
🎲 Generate Random Graph
Nodes
Density
✏️
Custom Input
Simple
JSON
Matrix
Format: u->v:capacity (comma or newline separated)
Standard JSON format
Capacity matrix (space-separated)
📥 Load Graph
🎮
Controls
▶️ Initialize
⏭️ Step Forward
⏩ Auto Run
🔄 Reset
👁️
Flow View
→ forward
← pushback
🔄
Algorithm Steps
1
Initialize
Set all flows to 0, build residual graph
2
Find Path (BFS)
Search for augmenting path from source to sink
3
Calculate Bottleneck
Find minimum residual capacity along path
4
Augment Flow
Update flows and residual graph
5
Complete
No more augmenting paths exist
📝
Execution Log
00:00
System ready
🛤️
Augmenting Paths Timeline
🔍
No paths found yet