Thinking Mathematically (6th Edition)

Published by Pearson
ISBN 10: 0321867327
ISBN 13: 978-0-32186-732-2

Chapter 14 - Graph Theory - Chapter 14 Test - Page 939: 16

Answer

The smallest total weight is 1445 when the Hamilton circuit is A,B,D,C,A or A,C,D,B,A. Since the total weight shows the cost in dollars, the smallest total cost is $1445
1514518917

Work Step by Step

We need to find the Hamilton circuit with the smallest total weight. We can use the Brute Force Method to find the optimal solution. The Brute Force Method involves listing all the possible Hamilton circuits and calculating the total weight of each Hamilton circuit. To find the total weight of a path, we can simply add up the weight of each edge in the path. The Hamilton circuit is A,B,C,D,A. total weight = 460 + 720 + 105 + 210 = 1495 The Hamilton circuit is A,B,D,C,A. total weight = 460 + 680 + 105 + 200 = 1445 The Hamilton circuit is A,C,B,D,A. total weight = 200 + 720 + 680 + 210 = 1810 The Hamilton circuit is A,C,D,B,A. total weight = 200 + 105 + 680 + 460 = 1445 The Hamilton circuit is A,D,B,C,A. total weight = 210 + 680 + 720 + 200 = 1810 The Hamilton circuit is A,D,C,B,A. total weight = 210 + 105 + 720 + 460 = 1495 Using the Brute Force Method, we can see that the smallest total weight is 1445 when the Hamilton circuit is A,B,D,C,A or A,C,D,B,A. Since the total weight shows the cost in dollars, the smallest total cost is $1445
Small 1514518917
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.