Explore and Learn
Dive deep into the core concepts of network flow.
Algorithm Visualizer
Step-by-step visualizations of Ford-Fulkerson, Edmonds-Karp, and Push-Relabel algorithms.
Residual Graphs
An interactive guide to understanding how residual graphs are built and used to find augmenting paths.
Core Theorems
Visualize the Max-Flow Min-Cut, Augmenting Path, and Flow Decomposition theorems with interactive examples.
Time Complexity
Compare the theoretical and empirical performance of max-flow algorithms on graphs of different sizes.