DIJKSTRA’S ALGORITHMVideo representation by : Shubashri Dhamodaraswamy.

What is dijkstra’s algorithm

Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example,

road networks1 5 7

1

10 11 22

14

Manual Working

B

EA D

C

3

4

9

7

2

8

2

Manual Working

B

EA D

C

3

4

2

2

ORIGINAL GRAPH

22

REAL WORLD APPLICATION

THANK YOU FOR LISTENING

ALL THE BEST FOLKS !

That’s all folks !