title: Python Traveling Salesman Greedy Algorithm
body: <p>So I have created a sort for my traveling salesman problem and I con sort by the x-coordinates and the y-coordinates.</p>
  
  <p>I am trying to implement a greedy search, but am unable to.</p>
  
  <p>Also, each point is instantiated in the matrix city such as [0,3,4] where 0 is the header, 3 is the x coordinate, and 4 is the y coordinate.</p>
  
  <p>Here is my program which you should be able to run. The main problem is that my algorithm isn't working and I need help fixing it to a working greedy algorithm. You can find the algorithm near the end of the code.</p>
  
  <p><a href="http://pastebin.com/ABQ3x0PG" rel="nofollow">http://pastebin.com/ABQ3x0PG</a></p>
  
  <p>This is the text file you will need which it takes the input from.</p>
  
  <p><a href="http://pastebin.com/c1UQzqEB" rel="nofollow">http://pastebin.com/c1UQzqEB</a></p>