⚡ Reference ⚡
- Dijktra's Shortest Path Algorithm (Conceptual Idea): https://youtu.be/pVfj6mxhdMw?t=646
- Code Origin: https://www.udacity.com/blog/2021/10/implementing-dijkstras-algorithm-in-python.html
- Dictionaries Data Type: https://docs.python.org/3/tutorial/datastructures.html#dictionaries
- Reference to dict.get(key[, default]) : https://docs.quantifiedcode.com/python-anti-patterns/correctness/not_using_get_to_return_a_default_value_from_a_dictionary.html
ℹ Explanation has been included in the Dijkstra.ipynb. You could kindly view and run it via Colab