Register

How many MST is possible?

• edited by
2,014 views
5 votes
5 votes

Given graph using Prim’s or Kruskal’s algorithm, find out that how many distinct minimum cost spanning trees are possible___?

My answer was 1 and given is 2  ,what I am missing ?

  

Edit:I had confirmed with it and answer is only one tree possible.

• edited by
User Avatar

1 Answer

0 votes
0 votes
Yes....I m also getting 1 tree only !
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

5 votes
5 votes
3 answers
2
Kapil asked Jan 24, 2017
3,414 views
Difference between Kruskal's and Prim's algorithm ?
It may be the case that "Kruskal's Algorithm may not maintain connectivity while Prim's algorithm always does that" ? Any example which favours this ?
It may be the case that "Kruskal's Algorithm may not maintain connectivity while Prim's algorithm always does that" ?Any example which favours this ?
User Avatar
2 votes
2 votes
3 answers
3
Geet asked Oct 26, 2016
1,632 views
#algorithm
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
User Avatar
3 votes
3 votes
1 answer
4
Pooja Palod asked Oct 15, 2015
3,030 views
Cormen Edition 3 Exercise 23.2 Question 6 (Page No. 637)
Suppose that edge weights are uniformly distributed over half open interval $[0,1)$. Which algorithm kruskal's or prim's can make you run faster?
Suppose that edge weights are uniformly distributed over half open interval $[0,1)$. Which algorithm kruskal's or prim's can make you run faster?
User Avatar
Link Copied!