May 2006 - Boost-users - lists.boost.org

[BGL] parallel edges
by John Krajewski 01 May '06

01 May '06

How do I make a graph that will just ignore when I attempt to add a parallel edge? Is there a way to set this on the graph, or is it only determined by the type of storage structures I'm using with the graph? I want to use a vecS to store the edges, but I dont want to allow parallel edges. -John

2 1

Re: [Boost-users] adjacency_list directed to undirected conversion
by Sean Kelly 01 May '06

01 May '06

Doug, thanks -- that worked nicely. cheers Sean -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Douglas Gregor Sent: Wednesday, April 26, 2006 6:43 AM To: boost-users(a)lists.boost.org 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(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

[BGL] Inverting the map from strong_connected
by John Krajewski 01 May '06

01 May '06

Hi all, The function "strong_components" produces a mapping from vertex to component - but what I need is a mapping the other way, from component to vertex! Now of course I could go through the property_map, query each vertex, and create the new map myself, but theres got to be a better way. The map is just a writable_property_map concept, so theoretically I should be able to create my own somehow that will swap the key and value, but I'm not sure how I would do that. Any suggestions? I also want to create a graph of the strongly connected components, but I suppose theres no tricky way to do this - just go through each vertex in the returned map and add its connections to the strong component's connections (though there's probably something tricky I could do with iterators to make this automatic) Thanks for any help, my mind is still adjusting to being warped by this generic programming stuff :)

1 0

[serialization] My archive class + BOOST_CLASS_EXPORT
by Denis Kuznetsov 30 Apr '06

30 Apr '06

I have my own archive class (derived from binary_oarchive_impl). And I have a base abstract class and derived classes(non-abstract). I use BOOST_CLASS_EXPORT macro to register my derived classes. But it seems the macro works only for Boost archives, not for user defined archives. Is there any way to register derived classes to get the same functionality that BOOST_CLASS_EXPORT provides?

3 3