Bellman's and Bellman-Ford algorithm

[Erenjaeger]

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?

 

[jim mcnamara]

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?

 

[Erenjaeger]

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