实现基本回路矩阵所对应的线形树的方法

The Method of Realizing the Linear Tree Corresponding to the Fundamental Circuit Matrix

在网络拓扑学中要研究由矩阵实现为图的问题 ,通过对基本回路矩阵Bf 中各树支关联的单连支回路数性质的研究 ,提出了实现线形树的一种算法。它通过判断树支的边缘性质 ,逐个确定树支的排序 ,从而实现线形树。在树中添加连支即构成Bf

The problem forming matrix into graph in network topology is researched.This paper presents a algorithm of realizing linear tree in terms of researching the property of the number of one link ciruit through every tree branch in fundamental circuit matrix B f .The pendant property of tree branches is checked and the order of tree branches is determined step by step,then the linear tree is realized.The graph corresponding to B f is constructed through adding links to the tree.