Image
Comments
| Anonymous #859688 6 months ago |
Traveling salesman problem... Had to look that up again. First time I heard about that, it was on some Disney Channel original movie, I think. Something about a village of bees disguised as people or something... |
| Anonymous #859803 6 months ago |
The traveling salesman problem is that given a set of points in 2d or 3d space, there is no algorithm that can calculate the shortest route that passes through all points without calculating every permutation of possible routes. |