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
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
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.