SV30690015
A2 MATHS: 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 (With CD-ROM)
 
Requirement :
Qty :