
30 Jan
2009
30 Jan
'09
7:34 p.m.
On Fri, Jan 30, 2009 at 12:45:36PM -0500, Nick Edmonds wrote:
You can use the color map in kolmogorov_max_flow to determine the min cut found by the algorithm, but as mentioned, it may not be unique.
He needs k-way cut, which is related to multicommodity flow problems. Max-flow algorithms compute only 2-way cut (indirectly; thanks to the max-flow, min-cut theorem).