Review: MST Algorithms
l In a connected, weighted, undirected graph,
will the edge with the lowest weight be in the
MST? Why or why not?
l Yes:
n If T is MST of G, and A T is a subtree of T, and
(u,v) is the min-weight edge connecting A to V-A,
then (u,v) T
n The lowest-weight edge must be in the tree (A=)