Dijkstra algorithm | Code implementation

This video explains the implementation with code for the dijkstra algorithm which is also known as the single source shortest path algorithm.In this video, I have first shown the steps for the algorithm and then i have analyzed what data structures are required to find the shortest path from the source node to every other node or vertex.I have taken the simple implementation for easier understanding using arrays.You can implement using SET or MAP as well.I have shown dry run for an example and at the end of the video, i have shown the code walk through and explanation.CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

========================================================================
Join this channel to get access to perks:
https://www.youtube.com/channel/UCnxhETjJtTPs37hOZ7vQ88g/join

INSTAGRAM : https://www.instagram.com/surya.pratap.k/

SUPPORT OUR WORK: https://www.patreon.com/techdose

LinkedIn: https://www.linkedin.com/in/surya-pratap-kahar-47bb01168

WEBSITE: https://techdose.co.in/

TELEGRAM Channel LINK: https://t.me/codewithTECHDOSE

TELEGRAM Group LINK: https://t.me/joinchat/SRVOIxWR4sRIVv5eEGI4aQ
=======================================================================

CODE LINK: https://gist.github.com/SuryaPratapK/531ec1fd8efdaeb0c098b89a7a1a9d3e
USEFUL VIDEOS:-
Dijkstra algorithm: https://youtu.be/Sj5Z-jaE2x0