Instead of trying to find the shortest path through a set of points (x, y), this program does it in 3 dimensions, (x, y, z). Furthermore, I visualize each city with (Red=x, Blue=y, Green=z). The values of x, y, and z are between 0 and 255. I use 2-opt to find a good solution to this TSP problem.

click to watch

NUM_COLORS: Number of colors ("cities" to find a path through)
ANIMATE: Whether or not to animated the sorting process

Requires SDL2 for graphics. I included all the necessary files along with the .exe to avoid the hassle of installing SDL.