Re: [boost] [BGL] depth_first_visitor improvement?

From: Vladimir Prus (ghost_at_[hidden])
Date: 2002-01-25 08:06:59

David Abrahams wrote:
> ----- Original Message -----
> From: "Vladimir Prus" <ghost_at_[hidden]>
>
> > I don't think it will work
> >
> > 1--->2--->3(*)-->4-->5(*)
> >
> > \--->6-->7(*)
> > ("*" denote vertices with non-empty labels.)
> >
> > Starting search from 1, I'd like to find 3 and 7, and I don't want to
> > employ
> > overly complex logic to weed out 5.
> > If I filter out vertices with emply labels, I won't find anything at all.
>
> You need to filter out edges which leave labelled vertices.

Thanks! This will do for my case. However, I feel like this is not very 
direct way to accomplish the task. Further, it's less efficient as it would 
require examining vertex label once for each out-edge, not once for each 
search. Okay, I agree that this might not be a problem in practice.

- Volodya