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

From: Daniel Mitchell (danmitchell_at_[hidden])
Date: 2006-04-25 08:14:25

On the topic of filtered_graph, do any algorithms fundamentally require vertex 
indices to lie in [0,1,...,num_vertices), or is this needed/reccomended only 
when an algorithm has to allocate its own, say, color map? As noted in the 
documentation, such a requirement interacts badly with filtered_graph. The 
docs claim that "the problem is being worked on," but is it really?

Daniel

On Tuesday 25 April 2006 01:54, Sebastian Weber wrote:
> 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?
>
> Greetings,
>
> Sebastian
>
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users