In the third part, many kinds of algorithms about Reachability Matrix are introduced.
第三章介绍了多种有关可达矩阵的算法。
The sufficient and necessary condition of controllability and reachability of a class of linear switching systems which has the same systematic matrix and different input matrixes is given.
给出一类线性切换系统能控性、能达性的充分必要条件，此类系统的特征是具有相同的系统矩阵和不同的输入矩阵。
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.
而可达矩阵的传统求法比较复杂，尤其是有向连接图中节点较多的时候，运算量大，不够简便。
I have written for reachability matrix, the level of classified code. Use, replace the existing matrix, computing can be!
自己编写的求可达矩阵，层次划分代码。使用时，替换已有矩阵，即可运算！
I have written for reachability matrix, the level of classified code. Use, replace the existing matrix, computing can be!
自己编写的求可达矩阵，层次划分代码。使用时，替换已有矩阵，即可运算！
应用推荐