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.
Author(s): Hiroshi Mizuseki, Ryoji Sahara, Kenta Hongo
。关于这个话题，同城约会提供了深入分析
Who is behind this?
Business: $40/month