Discover more from Spanning Tree
How Dijkstra's Algorithm Works
What's the fastest way to get from one place to another?
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.