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

From: Sean Kelly (sean.kelly_at_[hidden])
Date: 2006-05-01 12:27:35

Doug,

thanks -- that worked nicely.

cheers

Sean 

-----Original Message-----
From: boost-users-bounces_at_[hidden]
[mailto:boost-users-bounces_at_[hidden]] On Behalf Of Douglas Gregor
Sent: Wednesday, April 26, 2006 6:43 AM
To: boost-users_at_[hidden]
Subject: Re: [Boost-users] adjacency_list directed to undirected
conversion

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
_______________________________________________
Boost-users mailing list
Boost-users_at_[hidden]
http://lists.boost.org/mailman/listinfo.cgi/boost-users