The distance matrix for 6 cities and corresponding edge costs (in ascending order) are provided below. Use this information to construct TSP tours.
| A | B | C | D | E | F |
|---|
| A | - | 75 | 96 | 13 | 77 | 59 |
| B | 75 | - | 74 | 15 | 26 | 22 |
| C | 96 | 74 | - | 60 | 29 | 54 |
| D | 13 | 15 | 60 | - | 25 | 50 |
| E | 77 | 26 | 29 | 25 | - | 52 |
| F | 59 | 22 | 54 | 50 | 52 | - |
Based on the above data, answer the given subquestions.
Start from city C and construct a tour using Nearest Neighbour Heuristic. Enter the path representation of the tour starting from city C. Use the same order in which cities were added to the tour.
Enter a comma separated list of city names.
NO SPACES, TABS, DOTS, BRACKETS, PARENTHESIS OR UNWANTED CHARACTERS.
Answer format: C,X,Y,Z