Dijkstra's Algorithm(shortest Route Algorithm) in Operational research (Example with double edges)

⚠️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. ......... https://youtube.com/channel/UCfEQUsGXCmqvEQ4y71VILLA Check playlists of: ➡️Ordinary Differential Equations (odes) ➡️Operational research (OR) ➡️Mathematical methods of physics (MMP) ➡️Statistics ➡️Measure theory 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.🤗