算法设计课程报告单源点最短路径问题，即，已知一个n结点有向图G＝（V,E）和边的权函数c（e），求由某指定结点V0到其他各个结点的最短路径，这里还假定所有的权都是正的。-Algorithm design courses report a single source shortest path problem, that is known to a n-node directed graph G = (V, E) and the edge of the right to function c (e), for a specified node from V0 to the other node point of the shortest path, there is also assumed that all of the right are positive.