Dijkstra's Algorithm(shortest Route Algorithm) Example#3 (Lecture:3)

⚠️Method to write shortest Route:
write 1 to 2 instead of (12) to show the distance between 1 and 2.
Same as 1 to 3 instead of (13)
1 to 4 instead of(14).
Use these notations for all shortest paths.
.........

Check playlists of Operational research for
Lecture:1
Lecture:2
on Dijkstra's Algorithm.

Check playlists of:
➡️Ordinary Differential Equations (odes)
➡️Operational research (OR)
➡️Mathematical methods of physics (MMP)
➡️Statistics
Subscribe to my YouTube channel for higher mathematics. Hit the bell icon to get updated.
Share my videos with your friends.
IF YOU ARE A STUDENT of BS Mathematics then my channel is surely helpful to you.🤗

Previous lectures are save in playlists.
Go and check.🙌