Skip to content
World 5 · Find the Way: A* vs Dijkstra · 11 min · PRO

Dijkstra: always expand the cheapest

A priority queue and a growing wave

PRO · Puzzle Algorithms Lab

World 5: Find the Way: A* vs Dijkstra is part of PRO

The first world of Puzzle Algorithms Lab is free. PRO opens the other 25 lessons in 6 worlds — simulations, quizzes and all.

  • Shortest path on a grid: from BFS to weights
  • A*: Dijkstra with a compass
  • A drone in a 3D city: more dimensions, same idea
  • Visit every stop once: the travelling salesman
  • Brute force blows up: factorial growth
PRO includes
  • All 60 labs — every world, every lesson
  • Practice exams and certificates

$8.33/mo, billed yearly ($99.99) · or $39.99 monthly

Unlock Puzzle Algorithms LabTry the free world
My notes
Only saved in this browserAll my notes →
← Shortest path on a grid: from BFS to weightsA*: Dijkstra with a compass →

Report a mistake

What is wrong?
0 / 2000 · at least 10 characters
Sent along with your report
  • Page
  • About Dijkstra: always expand the cheapest — Puzzle Algorithms Lab · puzzles/dijkstra
Plus your browser type. Reports go to our support system; see the privacy notice.