Dijkstra's Algorithm WA

#1

Please check the code below it is not showing the right answer

#2

if a node is not reachable from src then u have to print -1 also u have to cout endl after every test case

#3

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.