中文摘要：

给出了利用权矩阵求解最短路的一种方法．该方法直接在权矩阵中进行简单计算及标记，在最终得到的矩阵中，且通过已标记元素的数值及其位置即可得到源点到其他各点的最短路长及路径．该方法操作简单，且便于在计算机上实现．

英文摘要：

This paper is connected with the shortest path problem. A matrix method is proposed to solve the problem using Dijkstra algorithm, which can directly get the distance and the path from the source node to other nodes with simple calculation and label in weight matrix. The method can be easily completed on computer.