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