给定带权有向图 ，其中每条边的权都是非负实数。另外，还给定V中的一个顶点，称为源点。现在要计算从源到所有其它各顶点的最短路长度。这里路的长度是指路上各边权之和；-Given weighted directed graph, where each edge of the right of all non-negative real number. In addition, the return of a vertex set V, called the source. Now calculated from the source to all other vertices of the shortest path length. Length of the path here refers to the right of each side of the road, and