You have learned how to find maximum flow in networks.
Now I'll show you the flip side: minimum cuts. A cut divides a graph into two parts. The minimum cut is the cheapest way to disconnect the source from the sink. This has applications in network reliability, image segmentation, and clustering. You will learn what cuts are, how they relate to max flow, and how to find them. By the end, you will solve problems where you need to split networks or find bottlenecks.
