Re: [Boost-users] BGL: filtered graph question

From: Sebastian Weber (sebastian.weber_at_[hidden])
Date: 2006-04-25 10:13:04

Hi!

> The type for the vertex descriptors associated with the  
> filtered_graph, which is the same type as the vertex_descriptor for  
> the original Graph.

Ok, once again, I'm the one overlooking some parts of the docs, shame on
me! But another question: If I understand the implementation right, I
can call base() on a filtered_graph-iterator to get an iterator of the
base graph, right? This is just nice to know as this applies to all of
the filtered graph iterators and can be very handy.

Greetings,

Sebastian

> 
> Cheers,
> Jeremy
> 
> On Apr 25, 2006, at 8:20 AM, Sebastian Weber wrote:
> 
> > Hi!
> >
> >
> >> A quick look at the code tells that it is perfectly fine.
> >> The type of vertex_descriptor is the same as for the underlying graph
> >> and the vertex iterator is simply a filter_iterator using the  
> >> provided
> >> predicate.
> >>
> >
> > Thanks a lot. My first impression by looking at the code told me the
> > same story. But, I think this should actually be documented  
> > somewhere if
> > this is supposed to be the case or not. To me it feels like it is an
> > undocumented feature of the filtered_graph class and things in  
> > boost are
> > usually well documented ... shouldn't one add this?
> >
> > Greetings,
> >
> > Sebastian Weber
> >
> >
> >>
> >> Best,
> >> --
> >> Grégoire Dooms
> >>
> >> _______________________________________________
> >> Boost-users mailing list
> >> Boost-users_at_[hidden]
> >> http://lists.boost.org/mailman/listinfo.cgi/boost-users
> >>
> >
> > _______________________________________________
> > Boost-users mailing list
> > Boost-users_at_[hidden]
> > http://lists.boost.org/mailman/listinfo.cgi/boost-users
> >
> 
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users