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 →
10 Largest Data Breaches Since 2000 – Millions Affected
In light of the MySpace photo breach (due to their …
Fast Food Menu of Calories
How does the distribution of calories vary by fast food restaurant? Here’s a chart that shows all the menu items for ten of the biggest national fast food chains.
Fatal Traffic, When and Where
These are the traffic crashes that resulted in deaths in 2015, categorized by month, time of day, and factors involved.