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 →
Marital Status by Age
Separately, we looked at marrying age, divorce rates, and those who never married. Now let’s look at marital status all together, with the addition of the widowed status.
Data Underload #17: Famous Movie Quotes, p. 2
Carpe diem. Seize the data, boys. Make your lives extraordinary.
Mapping When and Where People Start their Commute
For commuters, the farther away you live from the workplace, the earlier you have to leave your house to get to work on time. How much does that start time change the farther out you get?