这种化繁为简的能力，就是每年的新硬件最令人着迷的地方。
* 时间复杂度: O(nlogn) 最坏: O(n²) 空间复杂度: O(logn) 稳定: ✗
，推荐阅读快连下载安装获取更多信息
Opens in a new window
Crucially, this distribution of border points is agnostic of routing speed profiles. It’s based only on whether a road is passable or not. This means the same set of clusters and border points can be used for all car routing profiles (default, shortest, fuel-efficient) and all bicycle profiles (default, prefer flat terrain, etc.). Only the travel time/cost values of the shortcuts between these points change based on the profile. This is a massive factor in keeping storage down – map data only increased by about 0.5% per profile to store this HH-Routing structure!
14:52, 27 февраля 2026Бывший СССР