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.
- DVD containing lesson, teacher introduction and feedback.
- CD-Rom with lesson plan, Ofsted feedback report, CPD activities and more...
|Buy as part of our JLC Pack!|
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.