title: Shortest total path among set of Latitude/Longitudes
body: <p>I have a set of 52 or so latitude/longitude pairs. I simply need to find the shortest path through all of them; it doesn't matter where staring point or ending point is. </p>
  
  <p>I've implemented Dijkstra's algorithm by hand multiple times before and don't really have the time to do it again. I've found a couple things that come close, but most require raw graphs with pre-computed weights for each edge. </p>
  
  <p>Do you know of any libraries or existing scripts/applications which will compute the shortest path in this manner?  The code/libraries would preferably use Python or Clojure but it really doesn't matter.</p>
  
  <p>Thanks </p>