第七色在线视频,2021少妇久久久久久久久久,亚洲欧洲精品成人久久av18,亚洲国产精品特色大片观看完整版,孙宇晨将参加特朗普的晚宴

為了賬號(hào)安全,請(qǐng)及時(shí)綁定郵箱和手機(jī)立即綁定
已解決430363個(gè)問(wèn)題,去搜搜看,總會(huì)有你想問(wèn)的

優(yōu)先級(jí)隊(duì)列作為最小堆c ++與python中的heapq

優(yōu)先級(jí)隊(duì)列作為最小堆c ++與python中的heapq

拉丁的傳說(shuō) 2023-07-05 10:29:32
我有以下 python 代碼:    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)...我需要將其轉(zhuǎn)換為 C++14,我嘗試了以下方法:#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);...}Visual Studio 中唯一以紅色彈出的問(wèn)題是這一行,currentNode = min_heap.pop(openList);正如您所看到的,它表示彈出的參數(shù)太多。如何以正確的方式做到這一點(diǎn)?
查看完整描述

1 回答

?
呼啦一陣風(fēng)

TA貢獻(xiàn)1802條經(jīng)驗(yàn) 獲得超6個(gè)贊

像下面這樣怎么樣?


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  

}


查看完整回答
反對(duì) 回復(fù) 2023-07-05
  • 1 回答
  • 0 關(guān)注
  • 112 瀏覽
慕課專欄
更多

添加回答

舉報(bào)

0/150
提交
取消
微信客服

購(gòu)課補(bǔ)貼
聯(lián)系客服咨詢優(yōu)惠詳情

幫助反饋 APP下載

慕課網(wǎng)APP
您的移動(dòng)學(xué)習(xí)伙伴

公眾號(hào)

掃描二維碼
關(guān)注慕課網(wǎng)微信公眾號(hào)