Re: [Boost-users] adjacency_list directed to undirected conversion

Sean Kelly wrote:

Hi All,

I have a directed adjacency_list graph for which I would like to identify connected components (ignoring the directed-ness). After poking around the BGL docs it seems that my best option is to role my own algo or build a edge_list graph from the original graph and run connected_components. Basically I want to identify disjoint subgraphs starting with a directed graph. Any advice is appreciated.

I consider a directed_to_undirected_graph adaptor would be useful. -- Regards, Janusz