About | Help  
  
 
WebsterComputerMath
 
ABCDEFGHIJKLMNOPQRSTUVWXYZ
 
LaLbLcLdLeLfLgLhLiLjLkLlLmLnLoLpLqLrLsLtLuLvLwLxLyLz
 

LABEL CORRECTING ALGORITHM

Label correcting algorithm - Arises in labeling algorithms for shortest path problem . Each iteration a label is set to an estimate of the shortest path from a given node. All labels become exact values at termination.