Shortest Path on Data Structure and Algorithms related Questions and Answers


Question :   What is running time of Dijkstra's algorithm using Binary min- heap method?
1. O(V)
2. O(VlogV)
3. O(E)
4. O(ElogV)
Answer :   4 - O(ElogV)  

* 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