Shortest Path on Data Structure and Algorithms related Questions and Answers


Question :   The maximum number of times the decrease key operation performed in Dijkstra's algorithm will be equal to ___________
1. Total number of vertices
2. Total number of edges
3. Number of vertices - 1
4. Number of edges - 1
Answer :   2 - Total number of edges  

* Be the First to Post a Comment.

Submit comment :


Captcha Image
Reload

Ask Question

Captcha Image
Reload

Note : Name and Email never shown.





Subscribe


Become a part of EducationForever. Subscribe to our FREE Newsletter