title: How to get the actual path found by Bellman-Ford
body: <p>I have a question regarding the bellman ford algorithm. I created this program that when given a graph will output the shortest distance between a source node and all other nodes. That part is working fantastic so I have outputs like this:</p>
  
  <pre><code>The cost table is: 
  Destination:   0    1   2   
  Cost:          0    4   6
  </code></pre>
  
  <p>So for instance the shortest distance between my source and node 2 is 6,which is great. But now I would like to get the actual routes instead of just their costs. Like instead of having only the cost on the route from s to v is 5, I would like something like the route is s-> b -> v. Is that at all possible using bellman ford or am I missing some part of it ? </p>
  
  <p>Thank you very much.    </p>