From: Björn Lindberg (yg-boost-users_at_[hidden])
Date: 2002-09-27 06:31:28
Jeremy Siek wrote:
>
> If I understand you correctly, there's an adaptor called filtered_graph
> that does this. You create a predicate functor that returns true for a
> leaf (the functor will need to contain a handle to the property map) and
> then the filtered_graph adaptor will give you all the various graph
> iterators. You'll probably just want to use the vertex_iterator of the
> filtered_graph.
Ah yes, this sounds exactly like what I need. Thanks.
Björn