[Boost-users] connected component on a directed graph

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