(b) Use Kruskal's algorithm to find a minimal spanning tree for the following graph, explaining each step. Draw the mini
Posted: Fri Jul 08, 2022 6:35 am
(b) Use Kruskal's algorithm to find a minimal spanning tree for the following graph, explaining each step. Draw the minimal spanning tree. Give the total weight of the spanning tree. 9 2 51 d 3 بن a 7 4 b (6 marks)