[Boost-users] [graph] how to find all vertices reachable from one edge of a starting vertex

Subject: [Boost-users] [graph] how to find all vertices reachable from one edge of a starting vertex
From: Michael Marcin (mike.marcin_at_[hidden])
Date: 2014-09-13 13:12:50

How can I find all vertices reachable by following one specified out-edge?

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

Does this work?