A2 Maths

Topic: Minimum spanning trees

In this lesson the class look at finding minimum spanning trees from a matrix. In previous lessons the students have been introduced to finding minimum spanning trees using Kruskal’s algorithm and Prim’s algorithm. Students apply these network algorithms to find the smallest way in which a network can be connected.

Duration: 28 mins

Members only, please subscribe

members-only

Document download

Lesson plan and feedback:

Members only, please subscribe

Activities:

Members only, please subscribe