
Boost Users : 
Subject: Re: [Boostusers] [graph] how to find all vertices reachable from one edge of a starting vertex
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 20140914 12:11:01
>________________________________
> From: Michael Marcin <mike.marcin_at_[hidden]>
>To: boostusers_at_[hidden]
>Sent: Saturday, September 13, 2014 11:12 AM
>Subject: [Boostusers] [graph] how to find all vertices reachable from one edge of a starting vertex
>
>
>How can I find all vertices reachable by following one specified outedge?
>
>Is there already an algorithm that does this?
>
>If not I think I could do it by:
>
> marking all vertices white
> mark starting vertex gray
> depth_first_visit the target of the specified edge
I may be misunderstanding what you are trying to do, but isn't the set of vertices reachable from the edge the same as the set reachable from its target? In that case, a normal BFS or DFS from the target of the edge would solve your problem directly.
 Jeremiah Willcock
Boostusers list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net