39,858 views
The Bellman-Ford algorithm (also called Bellman-Ford-Moore) is an algorithm for calculating the shortest path in a weighted directed graph. The algorithm has the particularity of allowing negative-weighted arcs (unlike Dijkstra's algorithm) Miniature made by: https://www.behance.net/yasoudesign #UniversitéOran1 #oran #ISTA #optimization #operationalresearch #algorithm #bellmanford