title: Shortest way between two points by going through all other points from point collection
body: <p>Given a point collection defined by x and y coordinates.</p>
  
  <p>In this collection I get the start point, the end point and all the other n-2 points.</p>
  
  <p>I have to find the shortest way between the start point and end point by going through all the other points. The shortest way is defined by its value and if possible the crossing point order. </p>
  
  <p>At a first look this seems to be a graph problem, but i am not so sure about that right now, any way i am trying to find this shortest way by using only geometric relations since currently all the information that i have is only the x and y coordinates of the points, and which point is the start point and which is the end point.</p>
  
  <p>My question is, can this way be found by using only geometric relations?</p>
  
  <p>I am trying to implement this in C#, so if some helpful packages are available please let me know.</p>