1.

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


Discussion

No Comment Found