实现矩阵中任意两点最短距离的计算，并显示出最短路径经历的节点-To achieve the shortest distance between any two points in the matrix calculations and displays the shortest path through node

dijk程序,主要寻找最优路径,是一种比较方便的算法-dijk process，in order to find the short routing，it is the convenient algorithm