Max-Flow Min-Cut Theorem

This interactive demonstrates the relationship between Maximum Flow and Minimum Cut. 1. Click Find Max Flow to see the Ford-Fulkerson algorithm find the maximum flow from Source (S) to Sink (T). 2. Manually find the 'min cut' by clicking on edges to sever them. A valid cut separates S from T. Your goal: Find a cut whose capacity equals the max flow.

Superpowers for your classroom

Copyright © 2025 Tutorly Technologies Inc.

All Rights Reserved