Dijkstra算法是解单源最短路径问题的贪心算法。其基本思想是，设置顶点集合点集合S并不断地做贪心选择来扩充这个集合。一个顶点属于集合S当且仅当从源到该顶点的最短路径长度已知。初始时，S中仅含有源。设u是G的其一顶点。把从源到u且中间只经过S中顶点的路称为从源到u的特殊路径，并用数组Distance记录当前每个顶点所对应的最短特殊路径长度。Dijkstra算法每次从V-S中取出具有最短特殊路长度的顶占，Distance就记录了从源到所有其它顶点之间最短路径长度。-Dijkstra algorithm is a single-source shortest path problem solution greedy algorithm. The basic idea is to set the vertex set point set S and continue to make the greedy choice to expand the collection. A vertex belongs to the set S if and only if the vertex from the source to the length of the shortest path is known. Initially, S contains only source. Let u be the one of the vertices of G. The middle from the source to u and the only way through is called S in the vertex u from the source to the special path and Distance Records with an array corresponding to each vertex the shortest path length special. Dijkstra algorithm to remove time from the VS special way with the shortest length of the top accounting, Distance to records from the source to all other length of the shortest path between vertices.