MATH 160 Midterm: MATH 160 KSU math160D Test2 F16
15 Feb 2019
School
Department
Course
Professor
Document Summary
Consider the graph with vertex set {a, b, c, d, e, f } and edge list. {ab, ac, bc, bc, cc, cd, ce, de, ef }. (a) draw the graph. (b) what is the distance between a and f and give a shortest path between a and f . If so highlight an euler circuit or path. If not, give an optimal eulerization of the graph. The following table give the distance in miles between ve cities a, b, c, d, and e. 15 (a) find the nearest-neighbor tour with a as the starting city. What is the length in miles of this tour? (b) find the cheapest-link tour and write down the circuit with a as starting city. Problem 6 [8 points] the following table give the distance between 6 cities a, b, c, d, e and: draw the corresponding graph and nd a mst in this network.
