The dashed circle shows the current best distance. As the algorithm finds closer points, the circle shrinks, which causes more subtrees to fail the "could contain a closer point?" test and get pruned. The search usually gets cheaper as it progresses.
不要让那种「我还不够好」的抑郁情绪吞没你，耗掉一段又一段生命。因为每次从这种低谷走出来，你都会发现自己又回到了起点。多去生活，多去写作。
，更多细节参见搜狗输入法2026
async *transform(source) {
tasks = append(tasks, t)