Topics in Contemporary Math (MAT 1171) <- Courses <- Sean Forman <- You Are Here
|
1) (5 points) Find a tour from the following system
using the Cheapest Link Algorithm. Also, compute the total distance
traveled.
| 1 2 3 4 5 | 6
-----------------------+--------------------------------+-------
1 Tulsa OK | 222 218 357 257 | 214
2 Dallas TX | 222 440 541 375 | 282
3 Kansas City KS | 218 440 237 308 | 322
4 Saint Louis MO | 357 541 237 536 | 297
5 Dodge City KS | 257 375 308 536 | 471
-----------------------+--------------------------------+-------
6 Little Rock AR | 214 282 322 297 471 |
2) (5 points) If you were to solve #1 with the brute force method how many circuits would you need to compute.
3) (5 points) Draw a graph with an Euler Circuit, but no Hamilton Circuit, and then draw a graph with a Hamilton Circuit, but no Euler Circuit.