0
[Added later – this question is not part of the original paper]
What is the time complexity of Dijkstra’s algorithm for a graph with V vertices and E edges when a binary heap (priority queue) is used?
- AO(V)
- BO(V + E)
- CO((V + E) log V)
- DO(V³)
Correct answer: C