# Dijkstra's Algorithm

### Estimated Time

1 hour

### Learning Objectives of the Experiment

In this experiment on Dijkstra's Shortest Path algorithm, you will learn following:

- (Understanding) Student is able to describe 2 real-world scenarios where shortest path algorithms are required.
- (Remembering) Can recall the time complexity of graph traversal.
- (Applying) Can analyze the problem and choose suitable shortest path algorithm.
- (Understanding) Understands the intuition of the algorithm and hence can implement the underlying data structures required.
- (Understanding) Can visually demonstrate the steps followed by Dijkstra’s Shortest Path Algorithm.
- (Understanding) Can recall and derive the space and time complexity of the Dijkstra’s Algorithm.
- (Applying) Can apply Dijkstra’s Algorithm in real world problems.