最短路径算法。

用无向带全图的邻接矩阵存储图，确定从源点出发到其它各点的最短路径。

输入：图中包含的顶点数n 边数m， 各边权值，用邻接矩阵或者邻接表存储。

输出：源点到其它各点的最短路径值。-Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.