This preview has intentionally blurred sections. Sign up to view the full version.View Full 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
This note was uploaded on 04/03/2008 for the course MATH 103 taught by Professor Berkowitz during the Fall '07 term at Rutgers.
- Fall '07