应用邻接矩阵求有向图的最短路径

Working out the Shortest Path in a Directed Graph by Applying Adjacent Matrix

有向图方法在工程设计中应用广泛,应用这种方法最有利于求解有向图中任意两顶点的距离,但一般情况下计算方法过程比较复杂。定义邻近矩阵的算法是改进的新算法,能够较简便的求解有向图中任意两顶点的最短距离及路径。

Directed graph method is widely used in engineering design because this method is the most conducive to solving the distance between any two vertices in a directed graph, although the calculation process is more complex in general. The algorithm of defining adjacent matrix is the new one for improvement because it will be easy to solve the shortest distance and path between any two vertices in a directed graph.