Bellman
Jump to navigation
Jump to search
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 |