最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.

使用能量最小法中的图割法，解决图像分类问题，最大流=最小割(The minimum method of energy in the map cut method to solve the problem of image classification)