一种计算网络两点间最小路集的方法
A Method to Calculate the Minimum Path Sets between Two Nodes in a Network
-
摘要: 基于网络联络矩阵,提出一种计算网络两点间最小路集的方法,并给出严格的证明。该方法把网络的 广义联络矩阵划去输入节点对应的列和输出节点对应的行后,将网络分析中路的计算转化为矩阵行列式的运 算。适用于任何有向、无向和混合网络。Abstract: Based on connectionmatrix, this paper presents a newmethod to calculate the minimumpath 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.
-
Key words:
- network analysis /
- matrix /
- 1-factor /
- matrix pure permanent
点击查看大图
计量
- 文章访问数: 1182
- HTML全文浏览量: 50
- PDF下载量: 225
- 被引次数: 0