The algorithm that finds all possible cuts is O(2^n). Returning only partial list of found cuts.\nTo ignore this warning

[mamorani]

The algorithm that finds all possible cuts is O(2^n). Returning only partial list of found cuts.\nTo ignore this warning type ''warning(''off'',''bioinfo:graphmaxflow:mincutsLimit'')'' and the algorithm will run until all cuts are found



graphmaxflow