| 一种计算网络两点间最小路集的方法 |
| |
| 引用本文： | 程世娟,何平.一种计算网络两点间最小路集的方法[J].西南交通大学学报,2002,37(1):95-98. |
| |
| 作者姓名： | 程世娟 何平 |
| |
| 作者单位： | 西南交通大学应用数学系,四川,成都,610031 |
| |
| 摘 要： | 基于网络联络矩阵，提出一种计算网络两点间最小路集的方法，并给出严格的证明。该方法把网络的广义联络矩阵划去输入节点对应的列和输出节点对应的行后，将网络分析中路的计算转化为矩阵行列式的运算。适用于任何有向、无向和混合网络。
|
| 关 键 词： | 网络分析 1－因子 矩阵纯真值 图论 最小路集 网络联络矩阵 矩阵运算 |
| 文章编号： | 0258-2724(2002)01-0095-04 |
A Method to Calculate the Minimum Path Sets between Two Nodes in a Network |
| |
| CHENG Shi juan,HE Ping.A Method to Calculate the Minimum Path Sets between Two Nodes in a Network[J].Journal of Southwest Jiaotong University,2002,37(1):95-98. |
| |
| Authors: | CHENG Shi juan HE Ping |
| |
| Abstract: | Based on connection matrix, this paper presents a new method to calculate the minimum path sets between two nodes in a network, and gives a precise proof of it. By this method, the rows corresponding to the input nodes and the columns corresponding to the output nodes in the general connection matrix of the network are eliminated, and the path calculation in the network is transformed to the operation of connection matrix determinant. The method is applicable to any oriented, nonoriented or mixed networks. |
| |
| Keywords: | network analysis matrix 1 factor matrix pure permanent |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
