title: Is the result of Bellman-Ford "all pairs" or "from one node" shortest paths? / Is there an all-pairs Bellman-Ford version?
body: <p>I am recently learning about graph algorithms and at my university we were taught, that the result of Bellman-Ford is a table of distances from all nodes to all other nodes (all-pairs shortest paths). However I did not understand how this is achieved by the algorithm and tried to understand it by watching YouTube videos and looking up definitions in Wikipedia and so forth...</p>
  
  <p>Now here comes the problem:<br>
  I could not find resources that described the algorithm in a way that the result would be the all pairs shortest paths table, but only "from one node to all other nodes".</p>
  
  <p>Can the Bellman-Ford algorithm be tweaked to achieve the all pairs shortest paths table or is my university-lecturer completely wrong about this? (He did explain some algorithm that delivered all pairs shortest paths and he called it Bellman-Ford, however I think this can not be Bellman Ford)</p>
  
  <p>EDIT: I absolutely understand the Bellman-Ford algorithm for the Problem "shortest path from one node to all other nodes".<br>
  I also understand most of the algorithm that was taught at my university for "all pairs shortest paths".<br>
  I am just very confused since the algorithm at my university was also called "Bellman-Ford".<br>
  If you speak German: Here is a video where the university lecturer talks about his "Bellman-Ford" (which I think is not actually Bellman-Ford):<br>
  <a href="https://www.youtube.com/watch?v=3_zqU5GWo4w&amp;t=715s" rel="nofollow noreferrer">https://www.youtube.com/watch?v=3_zqU5GWo4w&amp;t=715s</a></p>