MST_Handout - UML CS Analysis of Algorithms 91.404 Fall,...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
UML CS Analysis of Algorithms 91.404 Fall, 2004 Minimum Spanning Trees In class we discussed Kruskal’s greedy algorithm to construct a Minimum Spanning Tree (MST) of an undirected graph G=(V,E). The algorithm below is the same, but with different notation. Kruskal_Greedy_MST(G) E’ sort edges of E by non-decreasing weight/cost Initialize T to be empty for each edge e’ in E’ do if T union e’ is acyclic then T T union e’ if Vertices(T) = V and T is a single tree then break out of loop return T How do we know that the resulting tree T is an MST of G? Let cost(e’) = cost of an edge e’ and cost(T) = Σ e’ in T (cost(e’)). Theorem : Let T o be an MST of G. Then cost(T) <= cost(T o ). Proof : [based on Chartrand, Introductory Graph Theory ] If T = T o , then the theorem is trivially true. We therefore concentrate on the case in which T = T o . To prove the theorem in this case, we perform an iterative procedure designed to make T o increasingly similar to T; at the end of this procedure we will have transformed T
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/13/2012 for the course CS 91.404 taught by Professor Dr.karendaniels during the Fall '09 term at UMass Lowell.

Page1 / 2

MST_Handout - UML CS Analysis of Algorithms 91.404 Fall,...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online