The locking problem
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.
，这一点在同城约会中也有详细论述
Медведев вышел в финал турнира в Дубае17:59
ITmedia �r�W�l�X�I�����C���ҏW�������삷���������[���}�K�W���ł�