How many minimum spanning trees does the following graph have? Draw them. (Weights are assigned to edges).
The question is a bit ambiguous. It asks for minimum spanning tree which is 13 for this graph. Whereas the answer they are expecting is for number of minimum cost spanning tree which is 2.
“Minimum Spanning Tree” directly means that we have to find a spanning tree which is of minimum cost. The question is not ambiguous.
@Human
$2$ only. $\{AB,BC,AE,BD\}$ and $\{AB,BC,AE,CD\}$.
64.3k questions
77.9k answers
244k comments
80.0k users