Graph cut method -- implementation of max flow min cut algorithm
no vote
This program realizes the new algorithm of maximum flow minimum cut of boykov in 2004, which is applied in the graph cut model of image segmentation. It can optimize the energy function of graph cut, and the code is complete and can be realized.