EXM.1.AHL.TZ0.41
The weights of the edges in a simple graph G are given in the following table.
Use Prim’s Algorithm, starting with vertex F, to find and draw the minimum spanning tree for G. Your solution should indicate the order in which the edges are introduced.
Markscheme / solution
The edges are introduced in the following order:
FD, FC, CB, BA, CE A2A2A2A2A2
A2
[12 marks]
Examiners’ report
[N/A]