title: Weighted Graph Algorithm
body: <p>I have a weighted, directed graph with multiples edges starting from the ending at the same nodes.
  Ex.
  Multiple edges going from node A to node B.</p>
  
  <p>What would be the best search algorithm to get all of the paths to a certain node and the associated costs of these paths?</p>