10000 Create priority_queue_using_list.py by Ashley-J-George · Pull Request #2428 · TheAlgorithms/Python · GitHub
[go: up one dir, main page]
Skip to content

Create priority_queue_using_list.py #2428

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

Closed
wants to merge 10 commits into from
Closed

Create priority_queue_using_list.py #2428

Changes from 1 commit
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
f3ebf4c
Create priority_queue.py
Ashley-J-George Sep 14, 2020
3617e19
Update priority_queue.py
Ashley-J-George Sep 14, 2020
3529a68
Update priority_queue.py
Ashley-J-George Sep 14, 2020
3cdfb54
Update priority_queue.py
Ashley-J-George Sep 14, 2020
9c17c2c
Update priority_queue.py
Ashley-J-George Sep 15, 2020
738feef
Update priority_queue.py
Ashley-J-George Sep 15, 2020
735390b
Update priority_queue.py
Ashley-J-George Sep 15, 2020
670887e
Update priority_queue.py
Ashley-J-George Sep 15, 2020
a5a13d2
Update priority_queue.py
Ashley-J-George Sep 15, 2020
8726046
Update priority_queue.py
Ashley-J-George Sep 15, 2020
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
Prev Previous commit
Next Next commit
Update priority_queue.py
  • Loading branch information
@Ashley-J-George
Ashley-J-George authored Sep 14, 2020
commit 3529a687cec50876c2e10fa651f906de765ea926
2 changes: 1 addition & 1 deletion data_structures/queue/priority_queue.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -176,7 +176,7 @@ def enqueue(self, data: int) -> None:

def dequeue(self) -> int:
'''
This function returns the highest priority element from the ElementPriorityQueue in FIFO fasion.
This function returns the highest priority element from the ElementPriorityQueue in FIFO fashion.
If the ElementPriorityQueue is empty and this function is called then an exception is raised saying Under Flow!
'''
if len(self.queue) == 0:
Expand Down
0