I would like to ask about some specifics of the heaps and queues project. Have the items to be added to the advanced data structures library already been decided? How are the structures coupled to the BGL?
Also, I would like to implement the binomial heap structure. Would anyone have any pointers for getting to know Boost's internals?
Hi Alex, That's a lot of questions that I'm not entirely sure how to answer :) There isn't really an "advanced data structures" library. There are a number of libraries that contain data structures libraries. The heaps and queues project isn't really connected to the BGL. The BGL uses a couple of the heaps, but that's about it. I don't think there are any binomial heap data structures, so you're probably free to build from scratch. Andrew Sutton andrew.n.sutton@gmail.com