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.Higher 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=3, BC=6, AC=14. Find the minimum spanning tree weight.
A triangle network has vertices A, B and C, with edge weights AB = 3, BC = 6 and AC = 14.
Find the minimum spanning tree weight W.
Higher 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 create a cycle.
In an exam, recording edge decisions shows why your network connects every vertex at minimum total weight.
A triangle network has vertices A, B and C, with edge weights AB = 3, BC = 6 and AC = 14. Find the minimum spanning tree weight W.