Is the minimum spanning tree of a graph unique?
Provide an example to prove your answer.
A minimum spanning tree has already been computed for a
graph. Suppose that a new node is added (along with
appropriate costs).
How long will it take to re-compute the minimum spanning
tree?
Let T be a MST of a graph G and let L be the sorted list
of the edge weights of T.
Show that for any other MST T' of G, the list L is also the
sorted list of edge weights of T'.