You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The Bellman-Ford algorithm is a graph search algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph en.wikipedia.org cp-algorithms.com. It is more versatile than Dijkstra's algorithm as it is capable of handling graphs in which some of the edge weights are negative numbers.
Project for the second-semester course "Data Structures and Algorithms I" (ST0245) taught at EAFIT University (Medellín, Colombia) by prof Mauricio Toro
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later.