说明：  Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。
(Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm used to calculate a node to all other nodes in the shortest path. Main features are a starting point as the center outward layers of expanded extended to the end until the date.)