title: Find the shortest path between a given source and a set of destinations
body: <p>You are given a weighted connected graph (20 nodes) with all edges having positive weight. We have a robot that starts at point A and it <strong>must</strong> pass at points B, D and E for example. The idea is to find the shortest path that connects all these 4 points. The robot also has a limited battery, but it can be recharged in some points. </p>
  
  <p>After researching on the internet I have two algorithms in mind: <strong>Dijkstra's</strong> and <strong>TSP</strong>. <strong>Dijkstra's</strong> will find the shortest path between a node and every other node and <strong>TSP</strong> will find the shortest path that connects all points. Is there any variant of the <strong>TSP</strong> that only finds the shortest path between a set of nodes? After all, in the <strong>TSP</strong> all nodes are labeled <strong>"must-pass"</strong>. I'm still not taking in account the battery constraint.</p>
  
  <p>Thanks in advance!</p>