answer question 2

Answer for Question 2


no of vertices : 7
no of edges : 6
total weight : = 1 + 1 + 2 + 3 + 4 + 5
= 16




Reason for the name of minimum spanning-tree is because it minimize the total cost of providing highspeed communicatons between every pairs. In order to get the lowest cost we choose the minimum cost among the pairs. The lowest cost is 1 million dollars which connected between C with D and E with F. Since there is no more lines have the values of 1 milion dollar we take the second lowest value which is 2 million dollars which connect between A and B. The next one we take the cost of 3 million dollars which connect between C with F. Then we take the cost of 4 million dollars which connect between A with B but we do no take between C with E since it will form a cycle. There are onlu edges needed, so the last edges is the line that cost the lowest value among the cost that have not being choose which is 5 million dollars which connect between E with G.When all the cost of the cost being sum, the summation is 16 million dollars which is the minimum cost that can be get from the graph.