Dijkstra's Algorithm  for Maths

Dijkstra’s Algorithm
The way I would run this is to talk through the motivation for the algorithm from the presentation, and give the terminology worksheet to be filled in (answer in the presentation). We’d then work through the brute force worksheet. I might then run through the example, then give them the simple graph to fill in. Than we would work through TaskGraph1 for the graphs. Then I might get them to either code, or come up with graphs for them to solve in small groups or in pairs.
TPT presentation
Labels to fill in worksheets to give structure for the students to fill in answers
TaskGraph1 3 graphs to run Dijkstras on.
AnswerGraph1 and 2 -answers for the graphs
Brute force worksheet and brute force worksheet answers

Save for later
  • BruteForceWorksheet-01.png
  • AnswerGraph2.pdf
  • AnswerGraph1.pdf
  • TPTPresentation.pptx
  • TaskGraph1.pdf
  • AnswerGraph3.pdf
  • LabelsToFillinWorksheet6node.pdf
  • BruteForceWorksheet.pdf
  • BruteForceWorksheetAnswers.pdf
  • LabelsToFillinWorksheet2node.pdf
  • LabelsToFillinWorksheet3node.pdf
  • LabelsToFillinWorksheet4node.pdf
  • LabelsToFillinWorksheet5node.pdf
  • TerminologyWorksheet.pdf

About this resource


Created: Mar 21, 2019

Clip Art

png, 43 KB



pdf, 624 KB



pdf, 413 KB


Report a problem

Tes Paid Licence

How can I re-use this?