在给定的地图中，有些路径已经被描述出来，根据这些己经存在路径找出最优路

在给定的地图中，有些路径已经被描述出来，根据这些己经存在路径找出最优路径，传统的Dijkstra算法通常是根据式（3）来修改源节点 经过 到不在 中的节点 的距离。

結果 (英文) 1:

In the given map, some paths have been described, identify optimal path based on these already exist paths, traditional Dijkstra algorithm is normally based on the formula (3) to modify the source node after the node that is not in the distance.

結果 (英文) 2:

In a given map, the path has been described and some out to find the optimal path based on the path already exists, the traditional Dijkstra algorithm is usually according to the formula (3) does not modify the source node to the node through the distance.

結果 (英文) 3:

In a given map, some paths have been described, according to the existing path to find the optimal path, the traditional Dijkstra algorithm is usually based on type (3) to modify the distance through to node in the source node.