Graph-cut implementation is used for combinatorial optimization, which is a fast and robust means to achieve stereo matching, image restoration, segmentation.