Dijkstra's algorithm is a solution to the single-source shortest path problem in graph theory. It finds the shortest paths from a source vertex to all other vertices in a weighted graph where all edge weights are non-negative. The algorithm uses a greedy approach, maintaining a set of vertices whose final shortest path from the source vertex has already been determined.

1. Dijkstra's algorithm
1

2. Single-Source Shortest Path Problem
Single-Source Shortest Path Problem - The problem of finding shortest
paths from a source vertex v to all other vertices in the graph.
2

3. Dijkstra's algorithm
Dijkstra's algorithm - is a solution to the single-source
shortest path problem in graph theory.
Works on both directed and undirected graphs. However,
all edges must have nonnegative weights.
Approach: Greedy
Input: Weighted graph G={E,V} and source vertex v∈V,
such that all edge weights are nonnegative
Output: Lengths of shortest paths (or the shortest paths
themselves) from a given source vertex v∈V to all other
vertices
3

4. Dijkstra's algorithm - Pseudocode
4

5. Dijkstra Animated Example-1
5

6. Dijkstra Animated Example-1
6

7. Dijkstra Animated Example-1
7

8. Dijkstra Animated Example-1
8

9. Dijkstra Animated Example-1
9

10. Dijkstra Animated Example-1
10

11. Dijkstra Animated Example-1
11

12. Dijkstra Animated Example-2
12

13. Dijkstra Animated Example-2
13

14. Dijkstra Animated Example-2
14

15. Dijkstra Animated Example-2
15

16. Dijkstra Animated Example-2
16

17. Dijkstra Animated Example-2
17

18. Dijkstra Animated Example-2
18

19. Dijkstra Animated Example-2
19

20. Dijkstra Animated Example-2
Shortest Path from A to H,
A to C, C to D, D to E, E to G, G to F, F to H
20

21. End
21