Bellman: Difference between revisions
Jump to navigation
Jump to search
Created page with "Bellman-Ford algorithm solves the Shortest Path problem when then the nodes weight can be negative (unlike Dijkstra)." |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
Bellman-Ford algorithm solves the Shortest Path problem when | Bellman-Ford is a non-greedy algorithm which solves the Shortest Path problem when the nodes weight can be negative (unlike Dijkstra). | ||
== Resources == | |||
{| class="wikitable" | |||
! | |||
|- | |||
|https://www.youtube.com/watch?v=9PHkk0UavIM | |||
|- | |||
|https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm | |||
|} | |||
Latest revision as of 06:37, 11 June 2018
Bellman-Ford is a non-greedy algorithm which solves the Shortest Path problem when the nodes weight can be negative (unlike Dijkstra).
Resources
| https://www.youtube.com/watch?v=9PHkk0UavIM |
| https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm |