title: Algorithm: shortest path between all points
body: <p>Suppose I have 10 points. I know the distance between each point. </p>
  
  <p>I need to find the shortest possible route passing through all points.</p>
  
  <p>I have tried a couple of algorithms (Dijkstra, Floyd Warshall,...) and they all give me the shortest path between start and end, but they don't make a route with all points on it.</p>
  
  <p>Permutations work fine, but they are too resource-expensive.</p>
  
  <p>What algorithms can you advise me to look into for this problem? Or is there a documented way to do this with the above-mentioned algorithms?</p>