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

reformat

Browse Source
This commit is contained in:
zhm-real
2020-08-05 12:53:19 -07:00
parent b3f190ec36
commit 8e232410ed
31 changed files with 296 additions and 219 deletions
Download Patch File Download Diff File Expand all files Collapse all files
Search_based_Planning/Search_3D/queue.py
+7 -7
View File
@@ -53,7 +53,7 @@ class QueuePrior:
return len(self.queue) == 0
def put(self, item, priority):
heapq.heappush(self.queue, (priority, item)) # reorder x using priority
heapq.heappush(self.queue, (priority, item)) # reorder s using priority
def get(self):
return heapq.heappop(self.queue)[1] # pop out the smallest item
@@ -131,13 +131,13 @@ class MinheapPQ:
# def put(self, item, priority):
# count = 0
# for (p, x) in self.queue:
# if x == item:
# for (p, s) in self.queue:
# if s == item:
# self.queue[count] = (priority, item)
# break
# count += 1
# if count == len(self.queue):
# heapq.heappush(self.queue, (priority, item)) # reorder x using priority
# heapq.heappush(self.queue, (priority, item)) # reorder s using priority
# def get(self):
# return heapq.heappop(self.queue)[1] # pop out the smallest item
@@ -146,9 +146,9 @@ class MinheapPQ:
# return self.queue
# def check_remove(self, item):
# for (p, x) in self.queue:
# if item == x:
# self.queue.remove((p, x))
# for (p, s) in self.queue:
# if item == s:
# self.queue.remove((p, s))
# def top_key(self):
# return self.queue[0][0]