Bellman's and Bellman-Ford algorithm

  • #1
141
6

Main Question or Discussion Point

In the SPP part of my networks text book, 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 text book not being consistent with what they call it?
 

Answers and Replies

  • #2
jim mcnamara
Mentor
3,909
2,299
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?
 
  • #3
141
6
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
 

Related Threads on Bellman's and Bellman-Ford algorithm

  • Last Post
Replies
1
Views
622
Replies
7
Views
2K
  • Last Post
Replies
2
Views
3K
  • Last Post
Replies
1
Views
430
  • Last Post
Replies
3
Views
2K
  • Last Post
Replies
4
Views
765
  • Last Post
Replies
2
Views
858
  • Last Post
2
Replies
26
Views
18K
  • Last Post
Replies
2
Views
2K
Replies
2
Views
2K
Top