Re: [Boost-Users] BGL: Problem with parallel edges and filtered_graph

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2002-08-06 11:12:55

Hi Michael,

On Tue, 6 Aug 2002, Michael Kettner wrote:
kettne> connecting u and v. I would call this behaviour "surprising" for the
kettne> developer. What I expect is that in this case some existing AND visible edge
kettne> is returned, because I am working with a filtered graph "hiding" the filtered
kettne> edges.

That sounds good. How about you return the favor and send me a patch with
the fix ;)

You'll want to have the edge() function for filtered graph dispatch to two
functions based on the edge_parallel_category of the underlying graph. One
version will be just like the current implementation, and the other
version will do what you describe. I suggest using the underlying graph's
edge_range() function.

Happy coding,
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]
----------------------------------------------------------------------