Bellman-Ford Algorithm
The Bellman-Ford algorithm is a graph-searching algorithm that calculates the shortest paths from a single source vertex to all other vertices in a weighted graph. It is particularly useful for graphs containing negative weight edges.