0 votes 0 votes Compute minimum spanning tree for the following undirected, weighted graph, using Prim's algorithm The weight and number of spanning tree(s) are _____________ . A 38 and 2 respectively. 34 and 1 respectively. 34 and 2 respectively. D None of these. I am getting 2 possible spanning trees. 1: C-B-F(-E-G)-A-D AND 2: B-C-E(-G)-F(-B)-A-D Why are they choosing 1? Is it because of finding using prim’s algo? Ashish Goyal asked Jan 26, 2019 Ashish Goyal 543 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Bhagyashree Mukherje commented Jan 27, 2019 reply Follow Share Even I got 2 spanning trees.Can you please verify @Shaik Masthan 0 votes 0 votes Shaik Masthan commented Jan 27, 2019 reply Follow Share answer is wrong, it should be 2 spanning trees ! 1 votes 1 votes Bhagyashree Mukherje commented Jan 27, 2019 reply Follow Share Ok thanks 0 votes 0 votes Ashish Goyal commented Jan 27, 2019 reply Follow Share @Shaik Masthan @Bhagyashree Mukherje but when we run prim's algo, this would return only one among those 2 spanning trees [As the question says- "using Prim's algorithm"] right? So, i am little confused. What should we consider? 0 votes 0 votes Please log in or register to add a comment.
