Dijkstra algorithm | Single source shortest path algorithm

Описание: In this video,I have explained how to find the shortest path from a given source to all other nodes or vertices in a graph.In this video, i have explained the dijkstra algorithm which is a well known shortest path finding algorithm.This algorithm is also known as single source shortest path algorithm because here we find the shortest path from a vertex to every other vertex.I have explained the process and intuition for all steps of dijkstra algorithm by taking suitable examples.I have explained the time complexity at the end and have also explained where dijkstra algorithm won't work.In the next video,I will show how to code and implement dijkstra algorithm.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:
   / @techdose4u  

INSTAGRAM :   / surya.pratap.k  

SUPPORT OUR WORK:   / techdose  

LinkedIn:   / surya-pratap-kahar-47bb01168  

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

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

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

USEFUL VIDEOS:-
Spanning Tree (MST):    • Spanning Tree | MST | Graph Theory  

Prims algorithm:    • Prims algorithm | MST | Code implementation  
Kruskals algorithm:    • Kruskals algorithm | Construct MST  
Kruskal algorithm implementation:    • Kruskal algorithm implementation