title: Belman Kalaba algorithm explained
body: <p>Is there a difference between Belman-Ford and this?</p>
  
  <p>Can someone explain how to implement this in order to find the longest path between to given nodes? 
  I know the algorithm computes the shortest path between two nodes so if someone can explain how to implement that I can figure out how to modify it in order to give me the longest path. </p>