Hi Guys, Quoting from the docs (http://www.boost.org/libs/graph/doc/ filtered_graph.html) graph_traits<filtered_graph>::vertex_descriptor The type for the vertex descriptors associated with the filtered_graph, which is the same type as the vertex_descriptor for the original Graph. 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@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users
_______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users