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.
Included:
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
Powerpoint to teach A Level Further Maths Decision/Discrete Maths Option: Dijkstra’s Algorithm.
Primarily written for Edexcel but suitable for for OCR specifications. Complete, step-by-step approach with worked examples of A Level standard. Format is such that students can also use as revision at their own pace and includes a handy flowchart for revision.
The full set of 16 PowerPoints in this series cover the whole of the Edexcel D1 course:
Algorithms
Bin-Packing Algorithm
Critical Path Analysis (GANTT)
Dijjkstra’s Shortest Path Algorithm
Floyd’s shortest distance algorithm
Graphs & Networks
Kruskal’s Minimum Spanning Tree
Linear Programming
Planarity Algorithm
Prim’s Minimum Spanning Tree
Route Inspection Algorithm
Simplex Algorithm 1 - Edexcel tableau
Simplex Algorithm 2 (artificial variables) - Edexcel tableau
Simplex Algorithm 3 (Big M method) - Edexcel tableau
Sorting Algorithm: Quick-sort, Bubble-sort (& Shuttle-sort for OCR)
Travelling Salesperson Problem, including Nearest Neighbour Algorithm (+ tour improvement algorithm for OCR)
Updated 2022
This sheet gives links to videos on all 14 of the algorithms that are required for the Edexcel Decision Maths 1 module. Each video gives a demonstration of an individual algorithm, and can be shared with students as a revision resource or used as part of a teaching lesson. Each video can obviously be paused whilst the students work out what is coming next, or rewound to hear an explanation again.
The algorithms are:
Full Bin, First Fit, First Fit Decreasing, Bubble Sort, Quick Sort, Binary Search, Kruskal's, Prim's, Prim's - Matrix Method, Dijkstra's, Route Inspection, Maximum Matching, Finding Critical Paths and the Scheduling Procedure.
This is a PowerPoint presentation which uses animation, simple layouts, graphics and diagrams to clearly explain all topics required for a full understanding of Decision Maths Year 1, Algorithms on graphs. This is completely in-line with the Edexcel A-level Further Maths specification.
teachingisgood is happy to declare that this presentation also includes loads of practice questions, which build up a key understanding and build exam skills, as well as exam-style questions which push problem solving skills with questions aimed at the highest achieving students.
This presentation is part of a series of presentations for A-level Further Maths, some of which also include interactive quizzes, videos and fun ways to test students and develop knowledge.
The topics covered in this presentation is as follows.
Kruskal’s algorithm
Prim’s algorithm
Applying Prim’s algorithm to a distance matrix
Using Dijkstra’s algorithm to find the shortest path
Floyd’s algorithm
Decision Maths 1 - Shortest Path Algorithm A Powerpoint 97-2003 demo of Dijkstra’s algorithm for finding the shortest path in a network. Updated 18/02/10 to correct slight error in path order.