Exam (elaborations)
University of TorontoCSC 373a2 ( WITH DETAILED EXPLANATIONS )
- Course
- Institution
Problem 1 1. Given an algorithm taking inputs (a) G = (V; E) a connected, undirected graph (b) w : E ! Z+ a weight function (c) T ⊆ E, a MST of G (d) e1 = fu; vg 62 E, an edge no in G (e) w1 2 Z+, a weight for e1 and outputs a MST T1 for G1 = (V; E [ fe1g) with w(e1) = w1. For full marks, your al...
[Show more]