A feasible tie - line set were developed on base of adjacent matrix, path matrix and path sub - matrix.

结合图论中的邻接矩阵, 提出路径矩阵和路径子矩阵的概念及形成方法,进而提出求取可行 联络线 集合的算法.

互联网

Secondly, the concept of reconfiguration of adjacent matrix and repetitious division of bars is developed.

提出了邻接矩阵的重构、构件的多次划分和划分码的概念.

互联网