algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 17:34:49 +08:00
Code Issues Packages Projects Releases Wiki Activity

Corrected wrong Dijkstra priority queue implementation (#909)

Browse Source 
* Corrected wrong DFS implementation

* changed list into hash set for dijkstra priority queue implementation.
This commit is contained in:
zachzhu2016
2019-06-23 08:32:12 -07:00
committed by John Law
parent 12a16d63b7
commit a212efee5b
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
graphs/dijkstra.py
View File

@ -20,12 +20,12 @@ import heapq
def dijkstra(graph, start, end): def dijkstra(graph, start, end):
heap = [(0, start)] # cost from start node,end node heap = [(0, start)] # cost from start node,end node
visited = [] visited = set()
while heap: while heap:
(cost, u) = heapq.heappop(heap) (cost, u) = heapq.heappop(heap)
if u in visited: if u in visited:
continue continue
visited.append(u) visited.add(u)
if u == end: if u == end:
return cost return cost
for v, c in G[u]: for v, c in G[u]: