OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fixes bug in PriorityQueue Algorithm; Fixes syntax in code for array.

Browse Source
This commit is contained in:
Praful Katare 2023-10-08 01:32:49 +05:30 committed by GitHub
parent 895dffb412
commit 39086dc8ca
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
graphs/dijkstra_algorithm.py
View File

@ -21,11 +21,11 @@ class PriorityQueue:
def min_heapify(self, idx): def min_heapify(self, idx):
lc = self.left(idx) lc = self.left(idx)
rc = self.right(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 smallest = lc
else: else:
smallest = idx 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 smallest = rc
if smallest != idx: if smallest != idx:
self.swap(idx, smallest) self.swap(idx, smallest)
@ -43,7 +43,7 @@ class PriorityQueue:
min_node = self.array[0][1] min_node = self.array[0][1]
self.array[0] = self.array[self.cur_size - 1] self.array[0] = self.array[self.cur_size - 1]
self.cur_size -= 1 self.cur_size -= 1
self.min_heapify(1) self.min_heapify(0)
del self.pos[min_node] del self.pos[min_node]
return min_node return min_node