From: Douglas Gregor (doug.gregor_at_[hidden])
Date: 2006-04-26 08:42:30
On Apr 25, 2006, at 12:16 PM, Sean Kelly wrote:
> 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
To do this, you could use the incremental connected components
algorithms in the BGL. Those work equally well on directed and
undirected graphs.
Doug