LESSON 14 / 15

Weighted Graphs

When edges have costs — distance, time, price — the graph is weighted. Dijkstra’s algorithm finds the cheapest route from a start node to every other node.

🎓Expertlevel
⏱️17 minto finish
✏️2activities

📂 Data Structures🏷️ Data structures

🔒

You’ve finished your free lessons! 🎉

Create a free account to unlock every lesson, save your progress, keep your streak and get personal review suggestions. It takes 20 seconds.