Question

Draw two different minimum spanning trees for the graph below. 2 3 4 2 6 9 In your answer show the final trees including the weights on the links of the trees.

Answer 1

tree Minimum Spanning Griven A 4 B 1 Using krushlkals minimum spaning algerithm ->8elect the least coS edlge here least cost edge is hree CF Nexd least cost edge from graph Need not to be connected to euishing Select Vertices we foundteoo edges BE, BA Loth s ame both because they not form cost add Cycle -> 5o g1oph is

2 B e $2 1 ->Find neut least cost edge ohich is AD 23 M&ST LMinimum Spanning hee Oun So add to A 3 B 1 Find Ned minimum spanning cost i is 4 two edlges have 4 as tocight but in we add both il coill Arst we add BC cind 8C and Ac f Cycle so reel ound AL to malke form a hree.a malre tree-2 tsee- 2 Pe P C 4+ 2 7 F F

Finding minioum cost in gtaph is 6 So adld DG 6 to MST Tree - Trree 2 2 4 2 2 E 0 G F These aore the two reguired spanning hrees the final Spanming ree has Becouuse, Lohere n'is vertices in-1) edges 1dere oe have t Verhices so the mimmum edges Spanning dree has &
Thank you