说明：  单源最短路径问题。从文件中读入一个图，求一个顶点到其它所有顶点的最短路径。
(single source shortest path problem. Reading from the document into a plan and seek a culmination of all the other vertices in the shortest path.)