I think there are only 2 mst possible with min weight 6,7 so answer will be 7this question gets to many view just due to wrong interpretaion of question i.e. what actually asking in question is confusing means should we apply mst algo or not like this confusion .
ASNR1010
+1
@Arjun sir images are not visible which he is referring to… plz update this ans with an image
where is image ? :| @Lakshman Bhaiya the ans need an update the image is missing !!
Graph $G$ can be like this:
@Vikas123
then we have to include minimum 4 edges to make a spanning tree and we put edges 1 ,2 and 3 in a cycle. so 3 will be rejected.
=> 1 + 2 + 4 + 5 = 12
@Satbir
we can have edges 1 and 2, edge 3 makes cycle with 1-2, so take edge 4. Now edge 5 makes cycle with 1-4 and similarly edge 6 makes cycle with 2-4, so now we can only take edge 7.
max MST weight= 1+2+4+7=14.
@puja.See this...
Corrections or suggestions are welcomed.
as in 2,3 (we need to select smaller one so 2 has been selected)
NOTE:-just take all possible maximum and out of all possible maximum pick minimum
64.3k questions
77.9k answers
244k comments
80.0k users