title: How to solve such a shortest path problem with multiple starting points and multiple ending points？
body: <p>On a graph, there are multiple start points and end points. Each start point corresponds to more than one end point, and each end point corresponds to only one start point. I need to find all the routes from the start point to the end point on the map. Different routes can't cross, but allow them to overlap.</p>
  <p>At the beginning I used the A* algorithm to find every single route, but the latter route took more paths in order not to cross the previous route. I want to know if there is an algorithm that can consider the total length of all routes.</p>
  <p><a href="https://i.stack.imgur.com/2D21r.png" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/2D21r.png" alt="enter image description here" /></a></p>