Created a working Greedy TSP solver

This commit (hopefully) contains all of the files required to have a working
TSP approximation. I use a greedy approach: I choose a random starting point
and then choose the next closest point to that to create the chain. There is
nothing cleaver done here, just a typical Theta(n^2) approach.

Woo hoo! :)