Q10
What is the time complexity of Dijkstra's algorithm using a binary heap priority queue?
A.
O(V2)
B.
O(V log E)
C.
O((V + E) log V)
AnswerD.
O(E log V)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board