论文部分内容阅读
确定网络ｓ－ｔ间的路径是利用路径枚举法计算网络可靠性及确定ｓ－ｔ路由所必须的。本文在对以往确定网络ｓ－ｔ间路径算法的研究基础上，提出了一种新的确定路径的算法──邻接矩阵算法，该算法不仅节省计算机内存，减少了计算量，而且用节点序列表示的路径可方便地用于同时考虑节点和边失效情况下的网络可靠性计算。
Determining the path between networks s-t is necessary to calculate the network reliability and determine the s-t routing using path enumeration. Based on the previous research on the algorithm of determining the path between networks, this paper proposes a new path-determining algorithm - adjacency matrix algorithm, which not only saves the computer memory and reduces the computational complexity, but also uses the node sequence representation The path can easily be used to calculate network reliability with both node and edge failures.