New answers tagged traveling-salesman
1
The problem is known as the Generalized TSP problem.
0
By giving each string an ID,
For example: ['abc':0, 'bef':1, 'bcc':2, 'bec':3, 'bbc':4, 'bdc':5]
Capture the hamming distance of 0/1 for all qualified string pairs. Now you have
[[0, 4], [1, 3], [2, 3], [2, 4], [2, 5], [3, 4], [3, 5], [4, 5]]
where a map such as this can be produced from it:
{0: [4], 1: [3], 2: [3, 4, 5], 3: [1, 2, 4, 5], 4: [0, 2, 3, 5], 5: ...
Top 50 recent answers are included