Re: [Boost-users] Boost.Graph can a graph that is a directedS besafely converted to a bidirectionalS?

From: Jeremy Siek (jeremy.siek_at_[hidden])
Date: 2005-09-21 21:59:43

Hi Elisha,

On Sep 21, 2005, at 6:46 PM, Elisha Berns wrote:
>> You can use DFS or BFS with the reverse_graph adaptor <
>
> So if I take that route, will I get some benefit in terms of saving
> memory, or some other optimization?  I hate to sound thick-headed  
> here,
> but what is DFS or BFS going to do find in this case?

It's just a quick way to implement the approach you described
of finding all the vertices that depend on a particular vertex.
There's no special savings in memory or execution time.

>>> So I assume that to search for the dependents of vertex V I need to
>>> get
>>> all the in-edges of V, and the in-edges of all those in-edges
>>> recursively?

Cheers,
Jeremy