Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法是很有代表性的最短路径算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。注意该算法要求图中不存在负权边。-Dijkstra (Dijkstra) algorithm is a typical single source shortest path algorithm for computing a node to all other nodes of the shortest path. The main feature is the starting point for the expansion of the center outward, until the end of the extension to the end. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses as the basic content of a detailed introduction, such as data structure, graph theory, operations research, etc.. Note that there is no negative edge in the graph.