Bellman's and Bellman-Ford algorithm

  • Context: High School 
  • Thread starter Thread starter Erenjaeger
  • Start date Start date
  • Tags Tags
    Algorithm
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
Sign up Log in
2 replies · 1K views
Erenjaeger
Messages
141
Reaction score
6
In the SPP part of my networks textbook, it refers to Bellman's algorithm but also at times Bellman-Ford's algorithm, is there a difference between the two or is that just the writers of the textbook not being consistent with what they call it?
 
Physics news on Phys.org
Hmm. If it computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph I have seen it called both - Bellman-Ford, Bellman.
Bellman did other things for which he was noted. And I know next to nothing about them.

So what is your chapter on about?
 
jim mcnamara said:
Hmm. If it computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph I have seen it called both - Bellman-Ford, Bellman.
Bellman did other things for which he was noted. And I know next to nothing about them.

So what is your chapter on about?
the part I'm referring to is just about shortest path problems, apparently there is a difference between them but I'm not sure what it could be
 

Similar threads

What Edges Are Selected in the Bellman-Ford Algorithm?
  • evinda
  • · Replies 2 ·
  • Set Theory, Logic, Probability, Statistics
Replies
2
Proving the Minimum Directed Cycle Mean Cost Using Bellman-Ford Algorithm
  • Ganesh Ujwal
  • · Replies 1 ·
  • Precalculus Mathematics Homework Help
Replies
1