Re: [boost] [graph] kolmogorov_max_flow color map, gray state

Subject: Re: [boost] [graph] kolmogorov_max_flow color map, gray state
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2009-02-28 11:42:52

>
> 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_at_[hidden]