# Speaker 0: [3.36s - 4.40s]
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.。Line官方版本下载对此有专业解读
Что думаешь? Оцени!。im钱包官方下载对此有专业解读
公式： Softmax(xi)=exi∑jexj Softmax 输出的是一组归一化的概率，在图中使用 柱状图 (bar chart) 展示每个输入元素对应的概率值。
Minor road updates (like those in map data that might be a few months old if you're using maps from different regions) usually result in negligible cost differences for shortcuts, so the pre-calculated values remain effective.