But now, we can go beyond - and natively port to another system. While still there is effort involved (and a lot of love to pay attention to tiny details), it is no longer a many-month project restricted for a seasoned reverse engineer. We we get both performance, and size, close to the original.
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.
，更多细节参见wps
Figure 2: Example System
Global news & analysis