Seonglae Cho조건을 확인하며 edge 가중치를 업데이트하는 단계
It involves updating the distance estimates of vertices based on the distances of their neighbors
In Dijkstra's algorithm, relaxation is performed on the edges in the order of increasing distance from the source vertex, while in Bellman-Ford algorithm, all edges are relaxed in each iteration