Now, OsmAnd performs another Dijkstra search, but this time on the much smaller "base graph." This graph consists only of the border points and the pre-calculated shortcut values between them.
print(content);
，更多细节参见新收录的资料
cached_anchor = metas["cached_map_anchor"]，更多细节参见新收录的资料
packages, it is deeply influenced by them. diff-hl, ace-window,