











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 minweight edge connecting A to VA,



then
(u,v) Î T




n 
The
lowestweight edge must be in the tree (A=Æ)


