565 views

2 Answers

0 votes
0 votes

Using Kruskal Algo

9---10 =2

7-----8 =2

9------5=3

5------6=3

3------4=3

8----12=3

2-----6 =4

6-----11=4

11--12 =5

5------1=6

4-----8 =6

answer= 2+2+3+3+3+3+4+4+5+6+6 =41

Related questions

3 votes
3 votes
3 answers
3
kapilbk1996 asked Feb 2, 2018
4,178 views
How to approach such questions ? Please provide detailed solution. Answer given is option C
7 votes
7 votes
1 answer
4
vishal chugh asked Jan 18, 2018
2,141 views
The number of distinct minimum spanning trees for the weighted graph shown below is ___________.