This step rapidly finds the optimal sequence of border points and shortcuts to get from your start cluster's periphery to your target cluster's periphery. It's incredibly fast because it's ignoring all the tiny roads within intermediate clusters.
sequenceDiagram，更多细节参见搜狗输入法2026
if(length > h-length)，这一点在搜狗输入法2026中也有详细论述
The Future Trajectory of AI Search