Graph | Question 9

Last Updated :
Discuss
Comments

What is the time complexity of Dijkstra’s algorithm for adjacency list representation of a graph?

O(E Log V)

O(V Log V)

O(V*E)

O(V*V)

This question is part of this quiz :

Quiz On Graph Data Structure
Tags:
MCQ
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy