Q. The maximum number of times the decrease key operation performed in Dijkstra’s algorithm will be equal to
✅ Correct 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.