Ch. 6 HW - Dallas Using the cheapest- link algorithm, I...

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

View Full Document Right Arrow Icon
Chapter 6 Math homework 10/29/07 16. a. B,A,E,C,D = 19 b. B,A,C,E,D = 25 c. B,A,E,C,D = 19 28. a. (N-1)! = 720 6! = 720 N = 7 b. N(N-1)/2 = 66 N(N-1) = 132 12(11) = 132 N = 12 c. N(N-1) = 160,400 401(400) = 160,400 N = 401 32. a. A,E,B,C,D,A = 63 minutes b. D,A,E,B,C,D A,E,B,C,D,A c. A,E,B,C,D,A = 63 minutes 42. B,P,L,N,S,D,H,B = 4,093 miles P,L,N,S,D,H,B,P = 4,093 miles 44. B,D,C,A,F,E,B = 80 miles 54. yes; A,B,E,D,F,C 70. Cities in Order of Travel: Dallas Houston Denver Kansas City Memphis Atlanta Chicago Louisville Columbus Buffalo Boston
Background image of page 1

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

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

Unformatted text preview: Dallas Using the cheapest- link algorithm, I circled the smallest mileage of each row first. From these, I chose the smallest and listed the two cities involved here. I continued this process, and whenever a city was listed twice, I crossed out the row and column for that city. After Dallas, the reference vertex, was listed once in this I avoided it until there was only one other city left whereon I connected the last remaining foreign city to the home city....
View Full Document

Page1 / 2

Ch. 6 HW - Dallas Using the cheapest- link algorithm, I...

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