python中的最小堆c++与heapq的优先队列（如何将heapq.heappop（openList）转换为c++？）

Question

I have the following python code:

    import heapq
    heapq.heappush(openList, currentSearchNode)
    #NOTE List of nodes that have been checked
    closedList = []
    while openList:
        #NOTE Pop the lowest fscore (to-go + been from or gScore + hScore) and set it as current
        currentSearchNode = heapq.heappop(openList)
...

I need to convert it to C++14, I tried this:

#include <functional>
#include <queue>
priority_queue <Node, vector<Node>, greater<Node>> min_heap;
vector<Node> openList, closeList;
Node currentNode = Node(start, euclidean(start, end), 0);
min_heap.emplace(openList, currentNode);
while (!openList.empty()) {
    currentNode = min_heap.pop(openList);
...
}

The only problem in Visual Studio that pops up in red, is this line currentNode = min_heap.pop(openList); as you can see, it says, too many argument for pop. How to do it the right way?

Answer 1

How about like below;

while (!min_heap.empty()) {
     currentNode = min_heap.top(); // sets the top small (since std::greater used)element to currentNode;
     
     /* do something with currentNode */

     min_heap.pop(); // pops the element from container  
}