0 votes 0 votes how many numbers of MST possible for n vertex: 1. all the weight edges are distinct 2. all the weight edges are different Algorithms minimum-spanning-tree + – Hira Thakur asked Dec 9, 2016 retagged Jun 30, 2022 by makhdoom ghaya Hira Thakur 369 views answer comment Share Follow See 1 comment See all 1 1 comment reply mcjoshi commented Dec 9, 2016 i edited by mcjoshi Dec 9, 2016 reply Follow Share when all edges are have distinct wt, then only unique MST is possible. when all edges have same weight choose any $n-1$ edges out of the edges, that the graph containing $n$ nodes has. If you want to find maximum number of MST possible, then go with a complete graph of $n$ vertices and choose $n-1$ edges out of $\binom n 2$ edges. 1 votes 1 votes Please log in or register to add a comment.
0 votes 0 votes I see you both questions are same. Minimum Spanning Tree possible for distinct weight edges = 1. Minimum Spanning Tree possible for graph which does not have all edges distinct is >1 but cost of each such Minimum Spanning Tree will be same. Mehak Sharma 1 answered Dec 9, 2016 Mehak Sharma 1 comment Share Follow See all 0 reply Please log in or register to add a comment.