first pass at implementing a greedy algorithm
greedy tour now encapsulated in greedyTour() function
runs greedySubTour() n times and keeps the best one
better documented version, reverts to more efficient single call (instead of n calls) to greedyTour()
greedyTour slimmed down and WAY faster
runs for up to 5 minutes
Merge pull request #26 from osterbit/tom

latest greatest. ready for submission, I think