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 Nathan Yau See All →
What are the ingredients that make each cuisine? I looked at 40,000 recipes spanning 20 cuisines and 6,714 ingredients to see what makes food taste different.
Marrying Later, Staying Single Longer
Using a century of data, we watch the shift of marital status in the United States.