[Boost-users] adjacency_list directed to undirected conversion

From: Sean Kelly (sean.kelly_at_[hidden])
Date: 2006-04-25 12:16:55

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.

thanks

Sean