有没有C ++ MinMax堆实现？ [英] Is there a C++ MinMax Heap implementation?

问题描述

我正在寻找像stl（ push_heap ， pop_heap ， make_heap ），除了能够有效地弹出最小值和最大值之外。 AKA双端优先队列。如 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.

我的google-fu没有成果，但肯定是必须存在？

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

推荐答案

如果您正在寻找算法实现，请直接尝试 Google Code Search 。

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

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