Expand the pont

#1

any hint for 100 points?

#2

thanks for ans , got the ans. and i have one more doubt , i the implementation of this algorithm using priority queue , when we are updataing priority queue why we are only inserting elemnts not removing the previous , like we did using set implementation link:-https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-using-priority_queue-stl/

#3

ohh sorry , comment typed in wrong section

#4


used bfs

#5

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.