title: Finding the shortest path over multiple points
body: <p><strong>Requirements:</strong></p>
  
  <ol>
  <li><p>There are multiple targets that you need to visit on a graph (does not matter what order or how many times you visit each point)</p></li>
  <li><p>You can start from the starting point, visit all the targets and come back to the base.</p></li>
  <li><p>You are allowed to visit each target multiple times.</p></li>
  </ol>
  
  <p><strong>Question:</strong></p>
  
  <p>1) What algorithm should I use to approach this?</p>
  
  <p>2) My proposed approach</p>
  
  <p>Let's say targets = [A, B, C]</p>
  
  <ul>
  <li>I am thinking to use Dijkstra's algorithm to find the shortest path to any of the targets. </li>
  <li>Once I reach the target, I use Dijstra's to find any of the remaining targets. </li>
  <li>Once I have found all the targets, I will use Dijstra's to find the path back to the starting point.</li>
  <li>This should give me the shortest path to find all the targets and back home</li>
  </ul>