Re: [Boost-users] connected component on a directed graph

From: Jens Müller (jens.mueller_at_[hidden])
Date: 2007-09-13 11:31:44

gast128 wrote:
> Dear all,
> 
> I see that it is already posted a lot of times, but i couldn't find an answer. 
> Baiscally we want the connected component given a vertex given a directed 
> graph.
> 
> So a -> b -> c
>      -> d
> 
>     e -> f
> 
> would give {a, b, c, d} given b
> 
> - for directed graphs there is only the strong component algorithm
> - for undirected graph there is an algorithm
> - there seems no adapter to fool the Bgl for interpreting a directed graph as 
> undirected.
> 
> Can anyone help? I am not a graph (or Bgl) expert, so maybe I am overlooking 
> something.
> 

I have written an adapter for bidirectional -> undirected, but I don't 
think it is really fit for production use. You might wanna search the 
boost-devel list archives.

The code is at 
http://i11www.iti.uni-karlsruhe.de/~jmueller/undirected_graph_adapter.hpp

Jens