Cart is empty
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...
Video Preview
 |
Buy as part of our JLC Pack! |
Categories
Invoice request
Don't want to pay with your credit card?
When you reach the checkout page, you have the option of requesting an invoice in the payment section.
Order form and catalogue
Mediamerge Ltd, Trinity House, Cambridge Business Park, Cowley Road, Cambridge CB4 0WZ © 2011 Mediamerge Limited, a company registered in England. Company registration number: 06014471 VAT Registration Number: 972 7179 80. Registered Address: 20 Ditton Fields, Cambridge, CB5 8QL. Website: www.mediamerge.co.uk . |