Interactive Core Theorems

Visualize the foundational principles of network flow.

1. Max-Flow Min-Cut Theorem

This fundamental theorem states that in a flow network, the maximum flow from a source s to a sink t is equal to the minimum capacity of an s-t cut.

Interactive Steps:

  1. Run Max-Flow: Calculates the maximum flow using Edmonds-Karp.
  2. Find Min-Cut: Finds all nodes reachable from S in the residual graph. These nodes form one side of the cut (the S-side).
  3. Highlight Cut: Highlights the S-side nodes and the edges that cross from the S-side to the T-side.
Results:

Max Flow: ?

Min-Cut Capacity: ?