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. Algorithms algorithms minimum-spanning-tree kruskals-algorithm prims-algorithm + – sunil sarode asked Jan 2, 2018 • edited Jan 6, 2018 by sunil sarode sunil sarode 2.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Yes....I m also getting 1 tree only ! Chirag arora answered Jan 9, 2018 Chirag arora comment Share Follow See 1 comment See all 1 1 comment reply Chirag arora commented Jan 9, 2018 reply Follow Share 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! 0 votes 0 votes Please log in or register to add a comment.
