研究了对给定拓扑结构的通信网在假定节点完全可靠而边存在随机破坏的情况下，通过计算点对间的路由概率确定最佳可靠路由的两种算法———邻接矩阵算法和动态路由算法－ 邻接矩阵算法通过构造网络的邻接矩阵及一些相关矩阵，利用深度优先搜索的方法找到点对间的所有路由，进而计算各路由的概率并由此确定最佳可靠路由－ 动态路由算法则给出了在链路失效后，按照最短路径原则由失效链路的起始点重新构造最佳可靠路由的方法－ 图１，参５－ This paper studies two algorithms for determining the best reliable route by calculating the routing probabilities between point pairs under the condition that the communication network of a given topology is completely reliable and assuming random edges. Adjacency matrix algorithm and dynamic routing Algorithm - Adjacency Matrix Algorithm By constructing the adjacency matrix of the network and some correlation matrices, the depth-first search method is used to find all routes between point pairs, and then the probability of each route is calculated to determine the best and reliable route - the dynamic routing algorithm gives Out of the link failure, according to the principle of the shortest path from the starting point of the failed link to reconstruct the best reliable route - Figure 1, reference 5-