Dijkstra
这种算法的发展比较成熟，适用性也较为广泛，能够求出连通的网络图
中任何两点间的静态最短路径，是路径优化理论的基础，但是，在时变的交通信息里，
静态意义上算出的最短路径并不是其真正的最短路径，并且，
Dijkstra
这种算法的关
键是按照节点与起点距离递增的顺序，产生最短距离的过程，这个过程的计算很麻烦。
由于它只考虑了抽象网络的拓扑特性，(Dijkstra
The development of this algorithm is more mature, the applicability is more extensive, can find the connected Network diagram
The static shortest path between any two points is the basis of the theory of path optimization, but in the time-varying traffic information,
The shortest path of static meaning is not its true shortest path, and
Dijkstra
The shutdown of this algorithm
The key is the process of generating the shortest distance according to the order of the node and the starting distance, and the calculation of this process is troublesome.
Because it only considers the topological characteristics of the abstract network,)