| 509 | * Local search crashes if a TSP instance with less than 4 cities is solved |
| 510 | * swinkler: It seems to me that this problem occurs a TSP instance with less than 3 cities is solved |
| 511 | * abeham: I would argue that there does not exist a Traveling Salesman *Problem* with 3 or less cities. |
| 512 | * swinkler: Yes, on the one hand you're right here, but on the other hand one could also argue that that's an optimization problem that is really easy to solve. That's why I think that the algorithm should not crash whensolving a TSP with 3, 2, or even one city. |
| 513 | * abeham: done in r3706. I'm throwing an exception if there's just one city, because there's no way you can e.g. invert a "tour" of just one city. |