UVa 216 - Getting in Line

Summary
This is the standard Traveling Salesperson Problem, without going back home. Since n is at most 8, we can simply enumerate all the possibilities by exhaustive search without resorting to dynamic programming.

Explanation
Standard exhaustive search techniques should suffice.

Gotcha's

 * Rounding errors.

Input
6 5 19 55 28 38 101 28 62 111 84 43 116 5 11 27 84 99 142 81 88 30 95 38 3 132 73 49 86 72 111 0

Output
Network #1 Cable requirement to connect (5,19) to (55,28) is 66.80 feet. Cable requirement to connect (55,28) to (28,62) is 59.42 feet. Cable requirement to connect (28,62) to (38,101) is 56.26 feet. Cable requirement to connect (38,101) to (43,116) is 31.81 feet. Cable requirement to connect (43,116) to (111,84) is 91.15 feet. Number of feet of cable required is 305.45. Network #2 Cable requirement to connect (11,27) to (88,30) is 93.06 feet. Cable requirement to connect (88,30) to (95,38) is 26.63 feet. Cable requirement to connect (95,38) to (84,99) is 77.98 feet. Cable requirement to connect (84,99) to (142,81) is 76.73 feet. Number of feet of cable required is 274.40. Network #3 Cable requirement to connect (132,73) to (72,111) is 87.02 feet. Cable requirement to connect (72,111) to (49,86) is 49.97 feet. Number of feet of cable required is 136.99.