s-t路径确定方法的研究  

An Approach to s-t Path Identification

作　　者：俎云霄[1] 吕航[1] 孙雨耕[1] 

机构地区：[1]天津大学电气自动化与能源工程学院,天津300072

出　　处：《电路与系统学报》2000年第3期87-90,共4页Journal of Circuits and Systems

基　　金：国家教委博士点基金!(9505615)

摘　　要：确定网络ｓ－ｔ间的路径是利用路径枚举法计算网络可靠性及确定ｓ－ｔ路由所必须的。本文在对以往确定网络ｓ－ｔ间路径算法的研究基础上，提出了一种新的确定路径的算法──邻接矩阵算法，该算法不仅节省计算机内存，减少了计算量，而且用节点序列表示的路径可方便地用于同时考虑节点和边失效情况下的网络可靠性计算。The identification of s-t paths is a necessity for the evaluation of the network reliability using Path Enumerating Method and the identification of s-t routing. Previous algorithms for s-t path identification are reviewed, A new algorithm-Adjacent Matrix Algorithm (AMA) is proposed. Compared to the previous algorithms, AMA uses less computer space, decreases the computational complexity. It is more useful to evaluate the network reliability under the condition of edge and node failures.

关 键 词：网络 路径 算法 

分 类 号：TN711[电子电信—电路与系统]