In a nutshell
Bellman-Ford finds shortest paths from one start node even when edges can have negative weights, which Dijkstra cannot handle. It simply relaxes every edge over and over — V−1 full passes are always enough for the distances to settle. If one more pass still improves something, that proves a negative cycle exists and no shortest path is well-defined.