已知一个有向带权图G和图中某个源点V0，求得从该源点V0到图中其它各个顶点之间 的最短路径。-Given a directed weighted graph G and a source figure V0, V0 obtained from the source to the other drawing the shortest path between the vertices.