How does the Bellman-Ford algorithm work to find the shortest path in a graph?

The Bellman-Ford algorithm works by repeatedly relaxing the edges of the graph, updating the shortest path estimates until the optimal shortest path is found. It can handle graphs with negative edge weights, unlike Dijkstra's algorithm.