Step 2 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 2Follow the worked example and explain why each modelling and calculation step is valid.
An undirected complete four-vertex graph has AB=3, AC=5, AD=7; BC, BD and CD each have weight 41. Find a minimum spanning tree and its total weight.
An undirected complete graph has vertices A, B, C and D. AB = 3, AC = 5 and AD = 7. BC, BD and CD each have weight 41.
Find a minimum spanning tree and its total weight W.
Higher Level Applied Maths · Algorithms, Optimisation & Project Scheduling · Step 2 of 8
A minimum spanning tree connects every vertex without cycles at the smallest possible total edge weight.
Exam solutions must justify both a valid connection and a minimum total, rather than merely select cheap edges.
An undirected complete graph has vertices A, B, C and D. AB = 3, AC = 5 and AD = 7. BC, BD and CD each have weight 41. Find a minimum spanning tree and its total weight W.