From: David Abrahams (david.abrahams_at_[hidden])
Date: 2002-01-25 08:13:55
----- Original Message -----
From: "Vladimir Prus" <ghost_at_[hidden]>
> > You need to filter out edges which leave labelled vertices.
> Thanks! This will do for my case. However, I feel like this is not very
> direct way to accomplish the task. Further, it's less efficient as it
> require examining vertex label once for each out-edge, not once for each
> search. Okay, I agree that this might not be a problem in practice.
Here's another thought:
Just make sure the filtered_graph is specialized on a user-defined predicate
type, then define an out_edges() function for this specialized graph which
returns an empty range when the source vertex is labelled. The filtering
predicate will never get used; it's just there to make sure you "own" the
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk