Question: What is the time complexity of Dijkstra\'s algorithm when using a binary heap?
Options:
Correct Answer: O(E log V)
Solution:
When implemented with a binary heap, the time complexity of Dijkstra\'s algorithm is O(E log V), where E is the number of edges and V is the number of vertices.