这个c程序实现几种2D和3D分割算法，这些算法可以参考下面这篇论文，程序的运行请查看README.txt-Camille Couprie, Leo Grady, Laurent Najman and Hugues Talbot , "Power Watersheds: A New Image Segmentation Framework Extending Graph Cuts, Random Walker and Optimal Spanning Forest", ICCV 09, 2009

强力分水岭，一种融合图割，随机游走，最小路径的基于图论的分割算法-Strong watershed, a fusion graph cuts, random walks, the minimum path segmentation algorithm based on graph theory