Draw a weighted graph in which the brute force, nearest neighbor, and best edge algorithms all give different Hamilton circuits.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.