是否有一个C ++最小最大堆实现？ [英] Is there a C++ MinMax Heap implementation?

问题描述

我要找的算法，如那些在STL（ push_heap ， pop_heap ， make_heap ）除与流行最小和最大值效率的能力。 AKA双端队列。如上所述<一个href="http://www.diku.dk/forskning/performance-engineering/Jesper/heaplab/heapsurvey_html/node11.html">here.

I'm looking for algorithms like ones in the stl (push_heap, pop_heap, make_heap) except with the ability to pop both the minimum and maximum value efficiently. AKA double ended priority queue. As described here.

不限干净实施的双端的优先级队列的也将是感兴趣作为替代，但是这个问题主要是关于一个MINMAX堆实施

Any clean implementation of a double ended priority queue would also be of interest as an alternative, however this question is mainly about a MinMax Heap implementation.

我的谷歌福一直没有收获，但肯定的是，它必须存在？

My google-fu has not been fruitful, but surely, it must exist?

推荐答案

如果你正在寻找算法实现直接尝试<一href="http://www.google.com/$c$csearch?hl=en&lr=&q=lang%3Ac%2B%2B+minmaxheap&sbtn=Search"相对=nofollow>谷歌code搜索。

If you're looking for algorithm implementation try directly Google Code Search.

这篇关于是否有一个C ++最小最大堆实现？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！