Dijkstra's Algorithm

1. What is the time complexity of Dijikstra’s algorithm? (V is the number of vertices in the graph)
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

2. Which of the following data structure can help decrease the time complexity of Dijikstra’s algorithm?
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

3. Dijkstra’s Algorithm can also be used on graphs with negative weights.
Explanation

Explanation

Explanation

Explanation

4. Dijkstra’s Algorithm is used to find:
Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation

Explanation