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

boost-users-request@lists.boost.org wrote:

Date: Tue, 25 Apr 2006 08:54:12 +0200 From: Sebastian Weber Subject: [Boost-users] BGL: filtered graph question

Hello everybody!

I use the filtered_graph framework to restrict a BFS visit to a small region on my graph. BUT, I provide the starting vertex to the BFS routine by a vertice_descriptor of the underlying/unfiltered graph. Of course, this vertice descriptor matches the predicate. My code compiles fine, but I started to ask myself if this actually behaves correct?

As I could not find a hint within the docs, does someone know?

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. Best, -- Grégoire Dooms