Mon 24th Sep - PRims Algorithm using an incidence MAtrix &

LEARNING OBJECTIVES: Discover how to complete Prims algorithm using an incidence matrix,  Discover how to find the shortest route between two vertices using Djikstr'a algorithm
SUCCESS CRITERIA: You will be able to find a minimum spanning tree using Prims algorithm on an incidence matrix. You will understand the basic concepts of Djikstra's algorithm to find the shortest route between two vertices on a network.
LESSON: 
Minimum Spanning Tree - Prims algorithm using an incidence matrix.

Finding the shortest route between two vertices on a network using Djikstra's Algorithm - Part 1, Part 2.

Use lessons with students solving problems together and also trying them individually.

PLENARY: Checking answers with students, supporting them whilst working on individual questions