Dijkstra algorithm

#1

IN THIS QUESTION WE HAVE TO IMPLEMENT HEAP ALSO.
IS THERE IS ANY OTHER WAY TO DO THIS?

#2

if you dont want to construct heap from scratch you can use inbuilt priority queue

#3

i have used priority queue but it is giving right answer on sample input

#4

but giving wrong answer

#5

share the link of your code here

#6


my code link

#7

dont use tree map in code…use hashmap and write an updatePriority function

#8

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.