该问题为单元最短路经问题，求出一个有向图中两点之间权值最小的路径。 Dijkstra算法要求有向图中没有权值为负的边，有向图的信息由一个邻接表来表示，另外对每个顶点都设置一个属性d[v]，描述从源点到v的最短路经上权值的上界。算法中设置一个顶点集合S，反复选择具有最短路经估计的顶点u∈V-S,并将u加入S中，算法中还用到了顶点的最小优先队列，排序关键字为顶点的d值。-The issue of the shortest path problem as a unit, find a directed graph between two points of the path of minimum weight. Dijkstra algorithm requires no power to map the edge value is negative, the information to the map by an adjacency list to represent an additional set of each vertex is an attribute d [v], described from the source point to the most short-circuit v on the right by the upper bound value. Algorithm to set up a vertex set S, repeatedly choose the shortest path with the vertex is estimated u ∈ VS, will u join the S, the algorithm is also used in the vertex of the smallest priority queues, sorting for the vertex of the d keyword value.