In a nutshell, the traveling salesman problem is as follows: “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?” Todd Schneider made an interactive that lets you punch in the cities yourself and then watch the process look for an optimum route. Fun to play with even if you’re not into processes. [Thanks, Todd]
A simulation of the traveling salesman problem
Projects by FlowingData See All →
10 Largest Data Breaches Since 2000 – Millions Affected
In light of the MySpace photo breach (due to their …
Guessing Names Based on What They Start With
I’m terrible at names, but maybe data can help. Put in your sex, the decade when you were born, and start putting in your name. I’ll try to guess before you’re done.