Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法是很有代表性的最短路径算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。Dijkstra一般的表述通常有两种方式，一种用永久和临时标号方式，一种是用OPEN, CLOSE表的方式，这里均采用永久和临时标号的方式。注意该算法要求图中不存在负权边。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm is used to calculate a node to all other nodes in the shortest path. The main characteristics is the starting point as the center outward expansion layers until the extension to the end date. The Dijkstra algorithm shortest path algorithm is very representative of the many professional courses as a detailed introduction to the basic content, such as data structures, graph theory, operations research, and so on. The Dijkstra general statements are generally two ways, one with permanent and temporary label, OPEN, CLOSE table, here are a permanent and temporary label. Note that the algorithm requires that there is no negative side figure.