Course contentsShow
Computer Science
Lesson 1031 of 2,87224. Minimum Spanning Trees and Network FlowPro lesson

The Max-Flow Min-Cut Theorem

Learn that the maximum flow value equals the minimum cut capacity in any flow network.

This lesson is for subscribers

You've completed the free preview. Subscribe to unlock every lesson in every course.