The idea is to provide template based containers which will provide general purpose tree containers as there are for Stack, Queue and few others in the Standard Template Library. As of now, I would like to propose the library to consist of 5 containers which includes: 1. Binary Search Trees 2. Red-Black Trees 3. B-Trees 4. Binomial Heaps 5. Fibonacci Heaps
I don't believe that this would be a suitable GSoC project for Boost. The C++ Standard Library already uses red-black trees to implement set and map, there has been recent work on B-trees (B+ trees?) for Boot and, (as Tim says), he worked on binomial and fibonacci heaps last summer.
what might be interesting is to introduce these data structures as part of boost.intrusive. boost.intrusive already contains red-black, avl and splay trees, but no pure heap data structures. cheers, tim -- tim@klingt.org http://tim.klingt.org You can play a shoestring if you're sincere John Coltrane