3 ms·
Exactly. Consider the case of all equal weights. In that case, every spanning tree is a MST. For the extreme cases (labeled complete graph, and a tree) of or
by pmiller2 15y ago
Exactly. Consider the case of all equal weights. In that case, every spanning tree is a MST. For the extreme cases (labeled complete graph, and a tree) of order n, those numbers are $n^{n-2}$ and 1, respectively, so the answer can be far from unique.