Glossary term
What is Bellman–Ford? Meaning for developers
Relaxes every edge for up to V − 1 rounds. It handles negative weights and 'at most k edges' limits.
Learn it properly · DSALesson 52: Shortest PathsBFS when all steps cost the same, Dijkstra for other costs, and Bellman–Ford for limits.