title: Multi-source single destination algorithm
body: <p>I have a graph where I need to find distances from multiple sources to single destination. I know how to find single source to multi destination using dijkstra's algorithm.</p>
  
  <p>I found an accepted answer here: <a href="https://stackoverflow.com/questions/28772855/algorithm-like-bellman-ford-only-for-multiple-start-single-destination">Algorithm like Bellman-Ford, only for multiple start, single destination?</a></p>
  
  <p>But I don't understand why it will work. can anyone explain why this answer works?</p>