Master Dijkstra's Algorithm in Just 3 Minutes π
Learn how to efficiently find the shortest path in a graph with this quick, step-by-step guide to Dijkstra's algorithm. Plus, access the full code on GitHub!
Michael Sambol
1.9M views β’ Sep 16, 2014
About this video
Step by step instructions showing how to run Dijkstra's algorithm on a graph.
Code: https://github.com/msambol/dsa/blob/master/shortest_path/dijkstras.py (different than video, I added this retroactively)
Source: Algorithms by S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani [https://www.amazon.com/Algorithms-Sanjoy-Dasgupta/dp/0073523402]
LinkedIn: https://www.linkedin.com/in/michael-sambol
Code: https://github.com/msambol/dsa/blob/master/shortest_path/dijkstras.py (different than video, I added this retroactively)
Source: Algorithms by S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani [https://www.amazon.com/Algorithms-Sanjoy-Dasgupta/dp/0073523402]
LinkedIn: https://www.linkedin.com/in/michael-sambol
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
1.9M
Likes
23.0K
Duration
2:46
Published
Sep 16, 2014
User Reviews
4.6
(373) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.