Question 1: Short answer
mediumAI-checkedSearch & PlanningSix cities have the symmetric distances below. The nearest-neighbour heuristic starts at A, repeatedly goes to the closest unvisited city, and finally returns to A. What is the length of the tour it builds?
| B | C | D | E | F | |
|---|---|---|---|---|---|
| A | 10 | 20 | 30 | 40 | 50 |
| B | 31 | 21 | 51 | 41 | |
| C | 12 | 59 | 100 | ||
| D | 5 | 8 | |||
| E | 69 |