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