说明：  将图的数据写入文件并构造邻接矩阵，求出单源点到其他顶点的最短路径
(The data of the graph is written into the file and the adjacency matrix is constructed, and the shortest path from the single source point to the other vertex is found)