How Dijkstra’s Algorithm Works

Dijkstra’s Algorithm allows us to find the shortest path between two vertices in a graph. Here, we explore the intuition behind the algorithm — what information we need to keep track of, in what order we need to explore vertices, and what the limitations of the algorithm are. *** Spanning Tree is an educational video series about computer science and mathematics. See more at To be notified when a new video is released, sign up for the Spanning Tree mailing list at Spanning Tree is created by Brian Yu. Email me at brian@ to suggest a future topic.