Skip to content

doc: adds some comments for clarification #6

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Nov 11, 2024
Merged

doc: adds some comments for clarification #6

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 5 additions & 4 deletions Ex_Files_Python_Data_Structures/Exercise Files/07_02_begin/priority_queue.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@

import heapq


# min heap implementation (smaller numbers have higher priority)
class PriorityQueue:
def __init__(self):
self.elements = []
Expand All @@ -16,15 +16,16 @@ def is_empty(self):

def put(self, item, priority): # push item into a PQ
heapq.heappush(self.elements, (priority, item))
# lower priority numbers get up first

def get(self):
return heapq.heappop(self.elements)[1]
return heapq.heappop(self.elements)[1] # select the number to remove from the tuple
# lower priority numbers are to be removed first (1 before 2 before 3)

def __str__(self):
return str(self.elements)


# lower numbers --> high priority task as in task scheduling (sys monitor)
if __name__ == "__main__":
pq = PriorityQueue()
# print(pq)
Expand All @@ -35,6 +36,6 @@ def __str__(self):
# print(pq.is_empty())

print(pq)
print(pq.get())
print(pq.get()) # removed 'code' from pq
print(pq)