Which of the following is the most commonly used data structure for implementing Dijkstra’s Algorithm?
A. Max priority queue
B. Stack
C. Circular queue
D. Min priority queue
Answer:D
Which of the following is the most commonly used data structure for implementing Dijkstra’s Algorithm?
A. Max priority queue B. Stack C. Circular queue 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.