中文说明：
最短路径问题的重要算法实现。已知点的邻接矩阵，可计算出出发点至目标点的最短路径即最短路径长度。
English Description：
The implementation of the most important algorithm for shortest path problem. The shortest path from the starting point to the target point, namely the shortest path length, can be calculated by the adjacency matrix of the known points.