In this video I explain the Bellman–Ford Shortest Path Algorithm step by step and walk through clear examples on weighted graphs with negative edges. You’ll see how to compute the shortest distance from one source node to every other node, how Bellman–Ford detects negative cycles, and how it compares to Dijkstra’s Algorithm. Then we implement Bellman–Ford in Python and use NetworkX to visualize the graph while a helper function generates GIFs that show the algorithm updating distances over time.
Written Guide (Medium): [link coming soon]
GitHub: https://github.com/KelvinLinBU/Bellman-Ford-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
