Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。本算法时间复杂度完全符合要求。-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 features is the starting point as the center outward expansion layers until the extension to the end point. Dijkstra algorithm is very representative of the shortest path algorithm, the basic content as described in detail in many professional courses, such as data structures, graph theory, operations research, and so on. Dijkstra　s general statements are generally two ways, one permanent and temporary label, one is using the OPEN, CLOSE table, there are permanent and temporary label. Note that the algorithm requires that the figure does not exist in the negative right side.