Dijkstra’s Shortest Path
Lesson notes
Overview
Always expand the closest unvisited node; distances settle permanently. This topic is rated beginner and is number 14 of 117 in Computer Science. Core ideas and first intuitions. No prior knowledge needed.
What you are seeing
The panel above shows an interactive animation of the idea. Every slider changes one quantity so you can see its effect on the outcome. The animation is drawn live from the model, so everything you see responds to the sliders. Press Space to pause, use Restart to replay from the start, and change the speed to slow down quick events.
In depth
Dijkstra’s algorithm finds the shortest routes from a source to all other nodes in a graph with non-negative edge weights. It keeps tentative distances and always takes the unvisited node that is closest, fixing its distance permanently, then relaxes its neighbours’ distances. With a priority queue it runs in O((V + E) log V). It underlies GPS navigation and network routing, but it fails with negative weights, where Bellman–Ford is used instead.
Reading the relationship
The expression "O((V+E) log V)" is a compact summary of the idea. It uses the symbols O, V, E; name what each one stands for before you start. Notice that it contains a logarithm, which turns multiplication into addition and compresses large values. Then use the sliders to see how changing one quantity changes the others.
A guided exploration
1. Run the animation once with the default settings and describe in words what happens. 2. Change one slider at a time and note which quantity responds most. 3. Push each slider to its extreme and decide whether the result still makes sense.
Try this
Start by only moving one slider at a time. Say aloud what you expect, then check.
Common pitfalls
Test small inputs by hand and then the largest ones. Off-by-one errors and forgetting how cost grows with input size are the most common traps.
How it connects
It builds on “Depth-First Search”, the topic before it in Computer Science. Once you are comfortable, continue with “Minimum Spanning Tree (Prim)”.
Why it matters
Computing ideas decide how fast, how safely and how well software can solve problems.
Where you might use it
- Revising “Dijkstra’s Shortest Path” before a class, exam or certification
- Choosing the right algorithm or data structure when writing software or apps
- Debugging programs and judging how fast or how safely code will run at scale
- Understanding how search engines, games, phones and AI systems make decisions
Frequently asked questions
What is Dijkstra’s Shortest Path?
Always expand the closest unvisited node; distances settle permanently. It is a beginner topic in Computer Science.
How do I use the Dijkstra’s Shortest Path simulation?
The panel at the top shows an interactive animation of the idea. Every slider changes one quantity so you can see its effect on the outcome. Move the sliders one at a time, then press Space to pause the animation and look closer.
What does the formula mean?
The expression O((V+E) log V) packs the idea into symbols. Name each symbol first, then change one quantity with the sliders and see which others respond.
Who is this topic for?
Core ideas and first intuitions. No prior knowledge needed. If the quiz feels hard, reread the lesson notes and try the previous topic first.
What should I learn before this?
Start with “Depth-First Search”, the previous topic in Computer Science. Each topic in a subject builds on the ones before it.
How do I track my progress?
Press “Mark as learned” on this page. Progress is stored only in this browser and is never sent anywhere. The Browse page can show topics you have learned or still need to learn.