Left-Edge Algorithm (LEA) (Hashimoto & Stevens)
Process horizontal tracks in order from top to bottom of channel and assign nets to tracks at each stage (assuming no cyclic constraints in VCG)
For track i, choose the “left-most net” of those who have no ancestors in the VCG
Repeat process until no additional nets can be assigned to the track
Guarantees a solution since there are no cyclic constraints permitted in VCG
In example, VCG permits (1,4,10) in first track, but only (1,10), (4,10) based on HIG; choose (1,10)