Can you please explain why we preferred set over priority queue in the implementation of dijkstra algorithm?
Why we used set instead of priority queue?
@HemantKumar, we used sets for the ease of implementation , as the priority_queue in the stl lacks some properties we need for dijstras. the major advantage we have using set(stl) is the ability to update, insert and delete the unique values and store in ordered manner. set provides us set.find() method which takes the value and finds if the value is present or not in the set . if present then it return the address of element in the set and if not then provides the address of set.end() . but in priority _queue(stl) we don’t have this property available to us.
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.