Q74
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
AnswerC.
Number of vertices - 1
D.
Number of edges - 1
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board