28 Feb
2009
28 Feb
'09
4:42 p.m.
And this works just fine. For some problems I am solving there are gray nodes, and I do not know how to determine their position relative to the edge cut set. Is there a code example available in the boost repository or has anyone had this problem?
I'm not especially familiar with the algorithm, but is it possible that the gray nodes are unconnected from the rest of the graph?
It seems surprising to me that obtaining the edge cut set of a linear min-cut problem seems to be non-trivial using the boost graph library. I must be doing something wrong.
What is the difficulty? Andrew Sutton andrew.n.sutton@gmail.com