Q21
How does the time complexity of Dijkstra's algorithm change when using a Fibonacci heap?
A.
It becomes O(V2)
B.
It becomes O(V log V)
C.
It becomes O(E log V)
D.
It becomes O(E + V log V)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board