saberbud/PathPlanning
1
0
Fork 0
mirror of https://github.com/zhm-real/PathPlanning.git synced 2026-08-30 09:00:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

update queue

Browse Source
This commit is contained in:
zhm-real
2020-07-02 17:01:34 -07:00
parent 514a661ad4
commit ad80dd02e2
11 changed files with 342 additions and 434 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Search-based Planning/Search_2D/queue.py
-16
View File
@@ -55,24 +55,8 @@ class QueuePrior:
def put(self, item, priority):
heapq.heappush(self.queue, (priority, item)) # reorder x using priority
def update(self, item, priority):
count = 0
for (p, x) in self.queue:
if x == item:
self.queue[count] = (priority, item)
break
count += 1
def get(self):
return heapq.heappop(self.queue)[1] # pop out the smallest item
def enumerate(self):
return self.queue
def remove(self, item):
for x in self.queue:
if item == x[1]:
self.queue.remove(x)
def top_key(self):
return self.queue[0][0]