Christopher Smith on Tue, 12 Oct 2004 02:01:56 -0500 (CDT)


[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: [ALACPP] gar!


Jon Stewart wrote:

The documentation for the Boost Graph Library is driving me insane (not to mention the C++ In Depth series book that covers it)!

Vertex iterators... check. Edge iterators... check. Adjacency iterators... check. DFS Vistor... double-check. But can I really be the only one who wants to associate an instance of a user-defined type/struct/class with each vertex, and do so simply? What's with all the property map bullshit? Great, that's nice for coloring, but am I really supposed to split up my struct into a million parallel property maps using some horrible BOOST_INSTALL_PROPERTY macro???

Of course, I am no doubt grossly misunderstanding the library, but I've yet to tease this seemingly common usage out of the documentation.
Hey! The list is working again. It's a miracle!

Here's a crazy thought... keep your structs/classes out of the graph. Have a simple mapping from vertex or edge id's to your object that is completely separate from the graph.

--Chris
_______________________________________________
alacpp mailing list
alacpp@xxxxxxxxxxx
http://lists.ellipsis.cx/mailman/listinfo/alacpp