Using the tab-separated file attached, find the traveling salesperson tour starting and ending at vertex 0. Your answer should use the greedy nearest-neighbor heuristic to get the answer. The optimal path is 699 miles, so if your approach gives an answer lower than that you have an error in your code.

6769424131253241466483901301641601331141461341118584865952475153493224243090181324323864747476616042445160668310211014718517915513315914612298105107797166707060484036332518017293845717757594641253036475271939813617217214812615814712412197997165596367624638374323131701221275460454641342034384853739699137176178151131163159135108102103736764697572544649543424291209154148353735261834364651709397134171176151129161163139118102101716565708478585056624132382190632382933302118353340456587911171661711441251571561391139597676062677982625359664538452715602532311413747575558638310510914718618816414417618216113411911686788488101108888086927164715441322506512554153646161668411111315018619216614718018816714012411990879094107114778692988074776048383260