title: shortest distance through coordinates
body: <p>I am given a set of point in the x-y plane ={(x1,y1),(x2,y2),.....(xn,yn)}</p>
  
  <p>and I am given two points a(xa,ya) and b(xb,yb) and asked to find the set of points that cover the shortest path.</p>
  
  <p>no connection between points are given. If I assume a connection to every other point.it will take a long time to compute these values for a weighted graph. Can someone tell me what reading I should do. what topic does this problem come under graph algorithms?!!(Is there any specific algorithm) I have been stuck on this for days. note: need to go through the points. cannot jump across the points. NO need to travel each and every point in the set. JUST THE POINTS THAT TAKE YOU TO POINT B and the distance covered in doing so should be minimum. ex: { (1,3),(1,4),(1,1),(5,2),(5,3),(1,4),(2,2),(1,2),(1,3)}
  and suppose A=(1,1) and B=(1,4) then the path={(1,1),(1,2),(1,3),(1,4)}
  note: paths need not be straight lines.can be zig zag too.</p>