![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
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. 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. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet