title: Run Dijkstra's Algorithm on a List<Point> in C#
body: <p>I have a list of Point types in C#. I want to run <a href="http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm" rel="nofollow">Dijkstra's algorithm</a> on this list of points where the first entry in the list is the starting location.</p>
  
  <p>Is there a way of doing this using an existing library?</p>
  
  <p>If such library doesn't exist, is there a way of calculating the distance between two points with x and y coordinates. For example, calculate the distance between point A (x coordinate =2, y coordinate = 4) and point B ((x coordinate =9, y coordinate = 7).</p>
  
  <p>I have used the ZedGraph library to build the graph.</p>