In this video I explain Dijkstraโs Shortest Path Algorithm step by step and walk through a clear example on a weighted graph. You will see how to compute the shortest distance from one source node to every other node and then implement the algorithm in Python using a priority queue and NetworkX.
Written Guide: https://medium.com/me/stats/post/eb2f67daa93c
Github: https://github.com/KelvinLinBU/Dijkstra_Tutorial
Big shoutout to @dontmakelies for her editing work!
Check out my book Modern Data: From Ingestion to Production available on Amazon, Apple Books, and Barnes & Nobles:
๐ Amazon ๐ : https://www.amazon.com/dp/B0GH8J71SC
๐ Barnes & Noble ๐: https://www.barnesandnoble.com/w/modern-data-kelvin-lin/1149201590?
๐ Apple Books ๐: https://books.apple.com/us/book/modern-data/id6757802062
