Step 3 of 8 · Worked example · TEACH
0 of 3 done
Work through the example to CHECK to open the problems.
Reach CHECK to open the problems.Ordinary Level · Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 3Follow the worked example and explain why each modelling and calculation step is valid.
A triangle network has edge weights AB=7, BC=10, AC=22. Find the minimum spanning tree weight.
A triangle network has vertices A, B and C. Edge weights: AB = 7, BC = 10 and AC = 22.
Find the minimum spanning tree weight W.
Ordinary Level Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 3 of 8
Kruskal's algorithm builds a minimum spanning tree by considering edges in increasing weight order and accepting only those that do not form a cycle.
Checking for cycles prevents you from choosing cheap edges that leave part of the network disconnected.
A triangle network has vertices A, B and C. Edge weights: AB = 7, BC = 10 and AC = 22. Find the minimum spanning tree weight W.