[ALACPP] gar!

["Jon Stewart" <stew1@xxxxxxxxxxx>]

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.



Jon
-- 
Jon Stewart                                 Advanced Los Angeles C++
stew1@xxxxxxxxxxx                           http://www.alacpp.org
_______________________________________________
alacpp mailing list
alacpp@xxxxxxxxxxx
http://lists.ellipsis.cx/mailman/listinfo/alacpp