Network Flow Visualizer (Max Flow/Min Cut)

Overview

The Network Flow Visualizer demonstrates the Ford-Fulkerson and Edmonds-Karp algorithms for computing maximum flow in a flow network. Model capacity-constrained networks and watch as the algorithms find augmenting paths to push maximum flow from source to sink. The max-flow min-cut theorem shows that maximum flow equals minimum cut capacity. Essential for understanding network optimization, bipartite matching, and resource allocation.

Open in new tab

Tips

  • Maximum flow is the greatest amount that can flow from source to sink
  • Ford-Fulkerson finds augmenting paths; Edmonds-Karp uses BFS (guarantees polynomial time)
  • Each edge has capacity - flow cannot exceed this limit
  • The max-flow min-cut theorem: max flow = min cut capacity
  • Applications: network bandwidth, bipartite matching, project selection
  • Residual graph shows remaining capacity after current flow
  • Watch how augmenting paths increase the total flow iteratively
  • The visualization shows flow/capacity for each edge (e.g., “5/10” means 5 units flowing, 10 capacity)