The Gateway to Computer Science Excellence
+5 votes
491 views

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.

in Algorithms by Active (1.2k points)
edited by | 491 views

1 Answer

0 votes
Yes....I m also getting 1 tree only !
by Junior (693 points)
0
If..edges having weight 10 would have been on same  side , and 20 weight edges also...then .. possibility would have been ,to get 2 Min Span trees!
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,356 answers
198,482 comments
105,250 users