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
Causes of Death
There are many ways to die. Cancer. Infection. Mental. External. This is how different groups of people died over the past 10 years, visualized by age.
One Dataset, Visualized 25 Ways
“Let the data speak” they say. But what happens when the data rambles on and on?