← 🧩 Algorithms Foundations22 / 25
Lesson 22 — Dijkstra (expert)
Shortest paths
Dijkstra finds the cheapest route in a weighted graph using a priority queue.
Why it matters: it powers maps, networks and routing.
Task
Print the shortest distance from A to C.
Keep going with Algorithms Foundations
Ready for more? These paid resources pick up where this lesson leaves off.
UdemyBestsellers
Top-rated Algorithms Foundations courses
Project-based Algorithms Foundations video courses — the perfect paid next step after these free lessons.
Browse on Udemy →AmazonReader picks
Best Algorithms Foundations books
Hand-picked Algorithms Foundations books to master the fundamentals offline.
See on Amazon →Some links on this page are affiliate links: we may earn a commission at no extra cost to you. We only recommend tools we believe are genuinely useful.