Dijktra's__Algorithm

#1


my code passes the sample input, but it is giving wrong answer on submission.please suggest any changes in my code.

#2

Hello @rajukumarbhui

Your implementation of the dijsktra’s algo is NOT correct.
In each iteration, you need to pick the node

  1. That is NOT picked yet.
  2. Has minimum distance from the start node.

Also the set ‘s’ is used to push nodes which are picked and NOT need to be visited again.
You should watch the dijsktra’s shortest path algo lecture again and try to implement it one more time.