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 →
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.
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.
It’s hard to think of much else. These maps show the racial divide between black and white people in major cities.