Which algorithm uses the concept of "relaxation" for finding shortest paths ?

Dijkstra's algorithm uses relaxation to iteratively improve shortest path estimates. For each neighbor, it checks if a shorter path exists through the current node and updates distances accordingly.