getting wrong answer. Plz check
Dijkstra's algorithm
@hari_2425
In dijsktra we don’t use condition that node is already visited or not. We can visit a particular node more then once. So delete line 42 to 44 and write
if(dist[el.F] > dist[nd]+el.S){
q.push(el.F);
dist[el.F] = min(dist[el.F], dist[nd]+el.S);
}