Mon 1st Oct - Dijkstra's Algorithm to find the shortest path between two vertices in a network.

LEARNING OBJECTIVE: Discover how to use Dijkstra's algorithm  to find the shortest route between to vertices in a Network.
SUCCESS CRITERIA: You will be able to find the shortest route between two vertices in a network using Dijsktar's algorithm

LESSON: Work thorugh this Lesson, using question screens with students.

Part 1
Part 2
Part 3

PLENARY: Checking Answers, Supporting Students as they work thorugh problems