![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
The maximum number of times the decrease key operation performed in Dijkstra’s algorithm will be equal to |
A. | total number of vertices |
B. | total number of edges |
C. | number of vertices – 1 |
D. | number of edges – 1 |
Answer» B. total number of edges | |
Explanation: if the total number of edges in all adjacency list is e, then there will be a total of e number of iterations, hence there will be a total of at most e decrease key operations. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet