Q. Which of the following is the most commonly used data structure for implementing Dijkstra’s Algorithm?
β
Correct Answer: (D)
min priority queue
Explanation: minimum priority queue is the most commonly used data structure for implementing dijkstra’s algorithm because the required operations to be performed in dijkstra’s algorithm match with specialty of a minimum priority queue.