 Bellman–Ford algorithm

The Bellman-Ford algorithm is an efficient algorithm used to find the shortest paths from a single source vertex to all other vertices in a graph. It is particularly useful for graphs that may contain edges with negative weights, making it more versatile than Dijkstra's algorithm, which only works with non-negative weights.