Warning Cookies are used on this site to provide the best user experience. If you continue, we assume that you agree to receive cookies from this site. OK
A2 Maths image

A2 Maths - Minimum spanning trees

 
£59.00
In stock
+

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.

Pack contents

  • DVD containing lesson, teacher introduction and feedback.
  • CD-Rom with lesson plan, Ofsted feedback report, CPD activities and more...

View lesson plan here.

Video Preview

 

JLC Pack Buy as part of our JLC Pack!
   

No posts found

Write a review

Licences Licences

Invoice request Invoice request

Order form and catalogue Order form and catalogue