114,808 views
Presentation, in a simplified and illustrated manner, of the Bellman-Ford algorithm for calculating minimal weight paths from a given vertex r, even if the graph contains negative weight arcs. This algorithm also allows to detect possible negative weight circuits accessible from r.