labelcorrecting
Label correcting, also spelled as label-correcting, refers to a class of algorithms for solving the single-source shortest path problem in directed graphs, particularly when edges may have negative weights but no negative cycles. The core idea is to maintain tentative distance labels (the current best estimates of shortest-path distances) for vertices and to iteratively update these labels by relaxing arcs, propagating improvements through the graph until stability is reached.
In a typical label-correcting approach, the source vertex is assigned a distance of zero and all other
The method encompasses several implementations. Bellman-Ford can be viewed as a label-correcting algorithm that relaxes all
Label correcting is applicable when negative edge weights are present but no negative cycles, and it is