In video , bhaiya says that in priority queue , we dont have any option of updating the distance of any node . Isnt it the same case for sets also since we are removing and then reinserting the node with update distace. we could do the same thing for heap also , then why is set preferred?
Dijkstra algo , Priority queue n set doubt
heap and priority queue are the same thing!
they have the same working structure.
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.