利用最大流标号法求解最大流,详见代码:
Version:未加头尾节点版;
缺点:havn't take nodes' pixels into consideration
/************************************************************************//* MaxFlow solve graph cut program *//************************************************************************//*File description:This program for graph cut based on Ford - Fulkerson Algorithm.Input: M(edge number) N(node number) then M lines input 3 parameters each line: start_point end_point edge_capacity e.g 5 4 1 4 40 1 2 20 2 4 10 4 3 30 3 2 10output: Line 1:maxflow value Line2:nodes in Class 1 e.g MAX Flow is 50 nodes in class S: 1 2=========================================================================CreateTime:2011-8-8Author:@Zhang Ruiqing*/#include