In the given implementation of the Dijkstra on sparse graphs using priority queue, there is a problem in the if(d_v != d[v]) instead it should be if(d[v] < d_v ...

Given a weighted, undirected graph $G$ with $n$ vertices and $m$ edges. You want to find a spanning tree of this graph which connects all vertices and has the least ...