420 views
2 votes
2 votes

1 Answer

Related questions

2 votes
2 votes
0 answers
1
Dulqar asked Jan 26, 2017
446 views
Show the different minimum spanning Trees Possible in each of the following AlgorithmsPrims AlgorithmKruskal
1 votes
1 votes
2 answers
2
0 votes
0 votes
2 answers
3
gshivam63 asked May 31, 2016
1,065 views
If average weight of a minimum spanning tree is Aavg.Then minimum spanning tree will have weight almost (n-1)Aavg, where n is no of vertices in the graph. It is true or f...
1 votes
1 votes
1 answer
4
radha gogia asked Feb 20, 2016
374 views
I tried by taking n=2 , and took points (1,1) ,(1,2) ,(2,2),(2,1) and I got the minimum weight to be 3 , which is n+1 but according to answer it is n-1