Re: [boost] [Boost] Is there any interest in min-max heap and bounded priority queue implementations?

Thank you for your feedback, Tim. Boost.Heap looks like an interesting library and probably suited for my code. I will checkout Boost.Heap and give it a more in-depth look. On Tue, Dec 13, 2011 at 11:31 AM, Tim Blechmann <tim@klingt.org> wrote:

...

I have implemented the min-max heap< http://www.akira.ruc.dk/~keld/teaching/algoritmedesign_f03/Artikler/02/ Atkinson86.pdf> algorithms and a bounded priority queue container adapter.

it might be an interesting addition to boost.heap. i won't have time to work on it myself, but if you plan to integrate it into boost.heap, i'll try to support your efforts!

tim