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 →
Mapping the Most Common Races
Select one or more races for a quick comparison. Counties are colored by the most prevalent.
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.
Income Taxes You Would Pay in Each State
Some states have high rates. Some have low. But whether a state is lower or higher for you depends on more than just the high brackets.