Boost logo

Boost Users :

From: gast128 (gast128_at_[hidden])
Date: 2007-09-12 08:06:33


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.

Wkr,
me


Boost-users 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