建立邻接矩阵(Adjacency Matrix Building) 可达矩阵运算(Reachable Matrix Computation) 对可达矩阵进行分解(Decomposition of Reachable Matrix) ..
基于12个网页-相关网页
自己编写的求可达矩阵，层次划分代码。使用时，替换已有矩阵，即可运算！
I have written for reachability matrix, the level of classified code. Use, replace the existing matrix, computing can be!
而可达矩阵的传统求法比较复杂，尤其是有向连接图中节点较多的时候，运算量大，不够简便。
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.
应用推荐