Re: [Boost-Users] graph: edge cuts

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2002-08-14 13:04:24

Hi Matthew,

On Wed, 14 Aug 2002, Matthew Galati wrote:
yg-boo> is this a place for simple usage questions?

Yes, you've found the right place.

yg-boo> i am a newbie...
yg-boo>
yg-boo> i want to use graph to return the set of edges in a cut for an
yg-boo> undirected graph...
yg-boo>
yg-boo> that is, for some subset W of N, i want all e = {i in N, j in N} in E
yg-boo> such that i is in W and j is not in W
yg-boo>
yg-boo> is there something built into graph to do this? or should i just do it
yg-boo> manually from the adjacency list?

The BGL does not have a function for this, so you'll have to code one
up... and better yet, you could put your new function in the
boost-sandbox, and then I could help you get it put into the BGL. If
you're interested send me private email.

Cheers,
Jeremy

----------------------------------------------------------------------
 Jeremy Siek                          http://php.indiana.edu/~jsiek/
 Ph.D. Student, Indiana Univ. B'ton   email: jsiek_at_[hidden]
 C++ Booster (http://www.boost.org)   office phone: [phone]
----------------------------------------------------------------------