title: Shortest Path distance between points given as X-Y coordinates
body: <p>I am currently working on a project that has a vector containing X and Y coordinates for approximately 800 points. These points represent an electric network of lines. 
  My goal is to compute the shortest distance Path between a Point A and Point B that can be or can not be located along the path given by the vectors containing the X-Y coordinates of the electric lines. </p>
  
  <p>I have read about the Dijkstra Algorithm but since i am not that much familiar with it, I am not sure if I should go in that direction. I will be very thankful if I can get any feedback or comments from you that can direct me to solve this matter.</p>