This preview shows page 1. Sign up to view the full content.
Unformatted text preview: f : 5 12 given by 9 , 6 , 4 , 2 , 1. 3. (6 pts.) Using an algorithm, nd the minimum weight spanning tree of the graph shown below. To show that you are using an algorithm, (i) identify it by either giving its location in the tex or describing it and (ii) list the order in which the algorithm selects the edges (and/or vertices) that form the spanning tree. 4. (6 pts.) Suppose the edges of a connected graph G all have dierent weights. Let e 1 , . . . , e d be the edges of G listed in increasing order of weights. Prove that the minimum weight spanning tree of G contains e 1 . Suggestion: Give a proof by contra-diction....
View Full Document
- Winter '08