最大堆
根节点最大。
最小堆
根节点最小。
boost中默认是最大堆,因此最小堆需要在compare函数return中为“>“。
示例代码:
#include <boost/heap/d_ary_heap.hpp>
#include <iostream>
using namespace std;
struct node {
int id;
node(int i)
: id(i){ }
};
//minimum heap
struct compare_node {
bool operator()(const node& n1, const node& n2) const {
return n1.id > n2.id;
}
};
int main() {
boost::heap::d_ary_heap<node, boost::heap::arity<2>, boost::heap::compare<compare_node>> heap;
heap.push(3);
heap.push(2);
heap.push(1);
for(auto& n : heap) {
cout << "every: " << n.id << endl;
}
//top is the smallest one.
cout << "top test:" << heap.top().id << endl;
}