Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 40
What is the time complexity of Dijkstra's algorithm with a binary heap?
A
O((V + E) log V)
B
O(V^2) always
C
O(E log E log V)
D
O(V + E)