This lesson is for subscribers
You've completed the free preview. Subscribe to unlock every lesson in every course.
Lesson 1050 of 2,872·24. Minimum Spanning Trees and Network FlowPro lesson
Min-Cut and Max-Flow Duality
Understand the max-flow min-cut theorem and how min-cut identifies bottleneck edges.