Spanning Tree

Share this post

How Dijkstra's Algorithm Works

spanningtree.substack.com

How Dijkstra's Algorithm Works

What's the fastest way to get from one place to another?

Spanning Tree
Aug 15, 2020
3
Share this post

How Dijkstra's Algorithm Works

spanningtree.substack.com

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.

Share this post

How Dijkstra's Algorithm Works

spanningtree.substack.com
Comments
TopNewCommunity

No posts

Ready for more?

© 2023 Spanning Tree
Privacy ∙ Terms ∙ Collection notice
Start WritingGet the app
Substack is the home for great writing