是从一个顶点到其余各顶点的最短路径算法，解决的是有向图中最短路径问题。迪杰斯特拉算法主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止(It is the shortest path algorithm from one vertex to the other vertices, and the shortest path problem in the directed graph is solved. The main feature of the Dijkstra algorithm is that it extends from the starting point to the outer layer until the end is extended to the end.)