make_heap
https://en.cppreference.com/w/cpp/algorithm/make_heap
struct ds
{
double value;
int idx;
ds(double v, int index) : value(v), idx(index){}
};
// 自定义比较函数
class CMP {
public:
bool operator()(const ds& a, const ds& b) {
return a.value< b.value;
}
};
std::vector<ds> edgeWeights;
std::make_heap(edgeWeights.begin(), edgeWeights.end(), CMP()); // max heap
while (edgeWeights.size() > 0) {
bool bHeap = std::is_heap(edgeWeights.begin(), edgeWeights.end(), CMP());
if (!bHeap) {
std::make_heap(edgeWeights.begin(), edgeWeights.end(), CMP());
// bHeap = std::is_heap(edgeWeights.begin(), edgeWeights.end(), CMP());
}
std::pop_heap(edgeWeights.begin(), edgeWeights.end(), CMP());
ds top = edgeWeights.back();
edgeWeights.pop_back();
edgeWeights.push_back(ds(0.0, 1, eId));
std::push_heap(edgeWeights.begin(), edgeWeights.end(), CMP());
continue;
}
priority_queue
https://en.cppreference.com/w/cpp/container/priority_queue
struct ds
{
double value;
int idx;
ds(double d, int index) : value(d), idx(index) {}
};
struct CMP : public std::binary_function<ds, ds, bool>
{
bool operator()(const ds& _Left, const ds& _Right) const
{
return _Left.value > _Right.value; // min heap
}
};
typedef std::priority_queue<ds, std::vector<ds>, CMP > DistancePriorityQueue;
priQueue.push(ds(2.0, 0));
while (!priQueue.empty())
{
ds di = priQueue.top();
priQueue.pop();
}
原文链接: https://www.cnblogs.com/xiaxuexiaoab/p/17071682.html
欢迎关注
微信关注下方公众号,第一时间获取干货硬货;公众号内回复【pdf】免费获取数百本计算机经典书籍
原创文章受到原创版权保护。转载请注明出处:https://www.ccppcoding.com/archives/314505
非原创文章文中已经注明原地址,如有侵权,联系删除
关注公众号【高性能架构探索】,第一时间获取最新文章
转载文章受原作者版权保护。转载请注明原作者出处!