Dijkstra's Algorithm for Shortest Path Problem with Example in HINDI/URDU

Hey Friends, iss video mein humne Dijkstra's Algorithm ko easy way me explain kiya hai with example. Dijkstra's algorithm is use to find the shortest path between  a (source vertex) and b (destination vertex). Download Notes: https://drive.google.com/open?id=1bv5rkRtGon2ASmiIjaXeAanYmpXMPvuJ Agar koi dbout ho dosto to aap hume comment karke ya mail karke bata sakte ho. Dosto video ko accha lage to share jarur karna aur channl ko subscribe jarur kar dena. Thank you so much. Email: [email protected] facebook: https://www.facebook.com/sourav.s.nag Twitter: https://twitter.com/SRN9999