Dijkstra's Algorithm - Step by step with illustration and sample Python code

Dijkstra’s algorithm is probably the most famous method for finding the shortest path between nodes in a graph. In this video, we’ll do more than just explore Dijkstra’s from a theoretical standpoint. We’ll also code it in Python, and then run that code against a sample graph, line by line, to really understand how it works. Apart from that, we’ll also touch on other topics, like graphs and priority queues.

00:00 Intro
01:32 Graphs
05:38 Algorithm explanation
16:57 Graph code representation
18:36 Algorithm coding
21:26 Algorithm execution

Full Data Structures and Algorithms course: https://www.udemy.com/course/data-structures-and-algorithms-in-python-gb/?referralCode=5C62F92791330B50A24D

Python heapq (priority queue) docs - https://docs.python.org/3/library/heapq.html

Music by - https://www.fesliyanstudios.com/
Images by - https://pixabay.com/users/clker-free-... https://pixabay.com/users/gdj-1086657/