Can you please help with the below computer science - Algorithmsquestion
Please do not copy existing Cheqq Question
13 Use Kruskal's algorithm to find the minimum spanning tree in the following graph. Draw the MST in the graph provided and indicate the order in which the edges are added. A 30 F A 12 F 9 18 B 10 G B 5 G 2 00 8 C 13 H a) (1 marks) Draw MST here, including weights of added edges: C 11 H 7 D b) (1 mark) What is the total weight of the MST? 15 I D I 4 8 00 H E 6 J E J c) (3 marks) In what order were the edges added? Give your answer as a list of vertex pairs. I.e. (AF), (CH), (AB), etc.
Can you please help with the below computer science - Algorithms question Please do not copy existing Cheqq Question
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am