Label-correcting shortest-path algorithm
= Label-correcting shortest-path algorithm
An algorithm whose tentative distance labels may be revised repeatedly until all relevant <Bellman inequalities> hold. <Bellman-Ford algorithm> uses this approach: a label is an upper bound supplied by a discovered <directed path>, and relaxing an <directed edge> can replace it with a shorter discovered <directed path>. A finite label is not declared permanent merely because it has been processed.