Dijkstra and Shortest Path Algorithms for Competitive Exams

Dijkstra and Shortest Path Algorithms - Complexity Analysis - Higher Difficulty Problems

Q. If a graph has 5 vertices and 10 edges, what is the maximum time complexity of Dijkstra's algorithm using an adjacency matrix?

Solution

Using an adjacency matrix, the time complexity of Dijkstra's algorithm is O(V^2), which in this case is O(5^2) or O(25).

Correct Answer: B — O(5^2)

Q. What is the space complexity of Dijkstra's algorithm when using a priority queue?

Solution

The space complexity of Dijkstra's algorithm when using a priority queue is O(V), as it needs to store the distance for each vertex.

Correct Answer: A — O(V)

Showing 1 to 2 of 2 (1 Pages)