Dijkstra’s algorithm practice for AQA A Level Computer Science (7517): twenty
different worksheets on the shortest path algorithm, each with a complete
answer key.

Every worksheet is built on a different weighted network. That is the point of
the pack: you can set one sheet in class, a second for homework and a third
for a resit without any two students ever holding the same questions, and
without drawing new networks yourself at eleven o’clock at night.

WHAT YOU GET

• 20 worksheets, 3 pages each, numbered 01 to 20
• 20 matching answer keys
• A contents table listing the number of vertices and the mark total of every
  sheet, so you can pick a six-vertex network for a ten-minute starter or a
  nine-vertex one for a full period

WHAT IS ON EVERY SHEET

Question 1 asks students to trace the algorithm: one row per vertex settled,
recording every tentative distance and the vertex it was reached from, written
as a subscript. Question 2 asks for the length of the shortest path and then
for the path itself, read back off the completed table - the step most
students never practise and most lose marks on. Question 3 asks why the
distance to a settled vertex can never be improved by a later step, for a
typical application of shortest path algorithms, and one further question that
varies from sheet to sheet.