Skip to content

Fixes bugs in graphs/dijkstra_algorithm.py #10092

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 6 commits into from
Aug 27, 2025
+7 −19
Merged

Fixes bugs in graphs/dijkstra_algorithm.py #10092

Changes from 1 commit
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
39086dc
Fixes bug in PriorityQueue Algorithm; Fixes syntax in code for array.
Kpraful Oct 7, 2023
2e60d1d
Merge branch 'master' into Adds-doctest-in-deapth_first_search_2
MaximSmolskiy Aug 27, 2025
6b37581
Update dijkstra_algorithm.py
MaximSmolskiy Aug 27, 2025
69043b3
Update dijkstra_algorithm.py
MaximSmolskiy Aug 27, 2025
12a61a7
Update dijkstra_algorithm.py
MaximSmolskiy Aug 27, 2025
f05d8f8
Update dijkstra_algorithm.py
MaximSmolskiy Aug 27, 2025
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
6 changes: 3 additions & 3 deletions graphs/dijkstra_algorithm.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -21,11 +21,11 @@ def is_empty(self):
def min_heapify(self, idx):
lc = self.left(idx)
rc = self.right(idx)
if lc < self.cur_size and self.array(lc)[0] < self.array(idx)[0]:
if lc < self.cur_size and self.array[lc][0] < self.array[idx][0]:
smallest = lc
else:
smallest = idx
if rc < self.cur_size and self.array(rc)[0] < self.array(smallest)[0]:
if rc < self.cur_size and self.array[rc][0] < self.array[smallest][0]:
smallest = rc
if smallest != idx:
self.swap(idx, smallest)
Expand All @@ -43,7 +43,7 @@ def extract_min(self):
min_node = self.array[0][1]
self.array[0] = self.array[self.cur_size - 1]
self.cur_size -= 1
self.min_heapify(1)
self.min_heapify(0)
del self.pos[min_node]
return min_node

Expand Down