Data Structure and Algorithms Project

Graph Shortest Path: Dijkstra Algorithm

1. You are to prepare a presentation slides to explain finding shortest path in a graph using Dijkstra Algorithm.

2. Tasks:

a. Introduce the algorithm (e.g. history, background, day-to-day application of the algorithm etc.)

b. With an example of a graph, show how Dijkstra algorithm is use to find shortest path in a graph (i.e. step-by-step).

c. Write your explanation in simple English and easy to understand.