Vidyalelo
Data Structure · Q136

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 136

Q136

What is running time of Dijkstra's algorithm using Binary min- heap method?

A.
O(V)
B.
O(VlogV)
C.
O(E)
D.
O(ElogV)
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board