26 Mar
2011
26 Mar
'11
5:39 a.m.
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
during last year's gsoc, i was implementing different heap data structures [1,2], including binomial and fibonaci heaps. maybe a good point to start? cheers, tim [1] http://tim.klingt.org/boost_heap/ [2] http://tim.klingt.org/git?p=boost_heap.git;a=summary