Routing algorithms in VLSI design form the backbone of interconnect synthesis, ensuring that circuit elements are connected efficiently while conforming to strict physical and timing constraints.

The longest straight-line route possible without ever crossing a body of water. The algorithm groups similar paths into the same ‘branch,’ then evaluates the branches against each other.