This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CS 373 Midterm 2 (October 31, 2000) Fall 2000 1. Using any method you like, compute the following subgraphs for the weighted graph below. Each subproblem is worth 3 points. Each incorrect edge costs you 1 point, but you cannot get a negative score for any subproblem. (a) a depth-first search tree, starting at the top vertex; (b) a breadth-first search tree, starting at the top vertex; (c) a shortest path tree, starting at the top vertex; (d) the minimum spanning tree. 4 1 6 1 7 8 9 5 3 1 1 1 2 2 2. Suppose you are given a weighted undirected graph G (represented as an adjacency list) and its minimum spanning tree T (which you already know how to compute). Describe and analyze and algorithm to find the second-minimum spanning tree of G , i.e. , the spanning tree of G with smallest total weight except for T . The minimum spanning tree and the second-minimum spanning tree differ by exactly one edge. But which edge is different, and how is it different? Thats what your algorithm has to figure out!figure out!...
View Full Document
This note was uploaded on 12/15/2009 for the course 942 cs taught by Professor A during the Spring '09 term at University of Illinois at Urbana–Champaign.
- Spring '09