第三章介绍了多种有关可达矩阵的算法。
In the third part, many kinds of algorithms about Reachability Matrix are introduced.
保留信息就是在建立可达矩阵的过程中得到的。
The retaining information is recorded during the process of TEM.
自己编写的求可达矩阵，层次划分代码。使用时，替换已有矩阵，即可运算！
I have written for reachability matrix, the level of classified code. Use, replace the existing matrix, computing can be!
在活动识别阶段，通过邻接矩阵、可达矩阵和强连通矩阵，对耦合活动进行识别。
In activities identification phase, coupled activities was identified by Boolean operation of adjacent matrix, accessible matrix and strong connected matrix.
引入了“可达矩阵”的概念，利用可达矩阵计算出了公交线网的平均换乘次数，并给出了算法。
Moreover, introduce the idea of reachability matrix, by which, figure out the average transfer times and come out the arithmetic.
而可达矩阵的传统求法比较复杂，尤其是有向连接图中节点较多的时候，运算量大，不够简便。
Howerer, the traditional algorithm of Reachability Matrix is comparative complicated, especially when there are more nodes in the Directed Graph, the arithmetic amounts are big and not enough simple.
关系矩阵，关系强度矩阵及其可达矩阵之间的函数集和副系统集都成立，因此，该系统的结构建立。
The relationship matrix, relationship intensity matrix and its reachable matrix between the function set and the sub-system set are set up, therefore the system structure is established.
经相似系数矩阵分析，发现用20 ~25对引物进行分析与用53对引物的分析结果可达极显著相关。
The similarity matrix correlation analysis showed that the result of 20 ~ 25 SSR loci was significantly correlated with that of 53 SSR loci.
有向图的邻接矩阵比较容易建立，但是在建立结构模型时，更有用的是要素间的可达关系。
The Adjacency Matrix of the Directed Graph is easy to build, but the reach-relation of factors is more useful when building the structure model.
本文首次检验了根据模型的可达性格纳姆矩阵识别相关发电机群的方法。
This paper describes the test of the method of identifying the group of coherent generators based on the controllability Grammian matrix.
介绍了由邻接矩阵求可达性矩阵的三个方法。
Three methods of computing accessibility matrix from adjacency matrix are introduced in this paper.
介绍了由邻接矩阵求可达性矩阵的三个方法。
Three methods of computing accessibility matrix from adjacency matrix are introduced in this paper.
应用推荐