Bellman's and Bellman-Ford algorithm

  • B
  • Thread starter Erenjaeger
  • Start date
  • #1
Erenjaeger
141
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?
 

Answers and Replies

  • #2
jim mcnamara
Mentor
4,700
3,650
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
Erenjaeger
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
 

Suggested for: Bellman's and Bellman-Ford algorithm

  • Last Post
Replies
3
Views
562
Replies
1
Views
451
Replies
3
Views
1K
  • Last Post
Replies
3
Views
951
  • Last Post
Replies
1
Views
697
  • Last Post
Replies
1
Views
892
  • Last Post
Replies
1
Views
1K
  • Last Post
Replies
1
Views
1K
Replies
2
Views
860
Top