Max-flow min-cut theorem
（重定向自Minimal cut）
![](/Images/godic/202501/27/Max-flow_min-cut_example.svg2233.png")
![A network formulation of the project selection problem with the optimal solution](/Images/godic/202501/27/Max-flow_min-cut_project-selection.svg2233.png")
![Each black node denotes a pixel.](/Images/godic/202501/27/Image_segmentation2233.jpg")
In optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the minimum cut, i.e. the smallest total weight of the edges which if removed would disconnect the source from the sink.