← 🧩 Algorithms Foundations25 / 25
Lesson 25 — Ultimate: Dijkstra with path
Boss level: shortest route
Extend Dijkstra to also reconstruct the actual path, not just the distance.
Why it matters: maps and games need the route itself.
Task
Print the shortest path from A to D.
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.