Commita212efe

authored and

committed

Corrected wrong Dijkstra priority queue implementation (#909)

* Corrected wrong DFS implementation* changed list into hash set for dijkstra priority queue implementation.

1 parent12a16d6 commita212efeCopy full SHA for a212efe

File tree

-2

lines changed

-2

lines changed

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -20,12 +20,12 @@`
`20`	`20`
`21`	`21`	`defdijkstra(graph,start,end):`
`22`	`22`	`heap= [(0,start)]# cost from start node,end node`
`23`		`-visited=[]`
	`23`	`+visited=set()`
`24`	`24`	`whileheap:`
`25`	`25`	`(cost,u)=heapq.heappop(heap)`
`26`	`26`	`ifuinvisited:`
`27`	`27`	`continue`
`28`		`-visited.append(u)`
	`28`	`+visited.add(u)`
`29`	`29`	`ifu==end:`
`30`	`30`	`returncost`
`31`	`31`	`forv,cinG[u]:`

Comments

(0)