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 →
Where People Work and How Much They Make
Salaries for occupations with the same job title can vary across industries. This interactive shows you by how much and who works where.
Bachelor’s Degree Movers
As industries change and interests shift, some bachelor’s degrees grow more popular while others become less so.
Shifts in Job Distribution
In the 1950s, almost half of all employed people were either in farming or manufacturing. As you can imagine, work changed a bit over the years.