Glossary term
What is relaxation? Meaning for developers
Update a neighbour's best-known distance when the route through the current vertex is cheaper.
Learn it properly · DSALesson 52: Shortest PathsBFS when all steps cost the same, Dijkstra for other costs, and Bellman–Ford for limits.