Shortest paths in networks

Use Dijkstra’s algorithm to find the shortest path between two vertices in a weighted network such as a road map.

⏱ 20 min❓ 9 questions

What you'll be able to do

✔I can read a weighted network and find the length of a route
✔I can apply Dijkstra’s algorithm systematically, updating labels as I go
✔I can use shortest paths to answer practical distance and travel-time questions

How this works

1Read the short explanations first — they teach you what you need before each question.
2Answer each question, then tap Check. A right answer moves you on automatically; if it's wrong, you'll see a friendly explanation of why.
3Finish all 3 steps to see your score — sign in and subscribe to unlock the full lesson and save it.

What's inside

9 questions and 1 quick teaching card, including:

✏️Fill in the blank — Type the missing word to complete the sentence.
🔢Number answer — Work out the answer and type the number.

👪Grown-up tip: sit alongside younger learners for the first few lessons. Read the questions together and chat about the explanations — that's where the real learning sticks.

Curriculum: AC9M10SP02