| 由邻接矩阵求解可达矩阵的一种改进简便算法 |
| |
| 引用本文： | 张静 李茂清. 由邻接矩阵求解可达矩阵的一种改进简便算法[J]. 数字社区&智能家居, 2007, 1(1): 177-178 |
| |
| 作者姓名： | 张静 李茂清 |
| |
| 作者单位： | 厦门大学自动化系,福建厦门361005 |
| |
| 摘 要： | 传统的由邻接矩阵求解可达矩阵的算法计算量很大，不适合手动计算，也没有提出相应的适合计算机的算法。这篇文章引入转移矩阵的概念．并在此基础上加以改进，形成一套完整的可行的求解可迭矩阵的方法。有效地减少了计算量。
|
| 关 键 词： | 邻接矩阵 可迭矩阵 有向图 |
| 文章编号： | 1009-3044（2007）01-10177-02 |
| 收稿时间： | 2006-10-21 |
| 修稿时间： | 2006-10-21 |
A Improved Simple Algorithm to Compute ReachabUity Matrix with Adjacency Matrix |
| |
| ZHANG Jing,LI Mao-qing. A Improved Simple Algorithm to Compute ReachabUity Matrix with Adjacency Matrix[J]. Digital Community & Smart Home, 2007, 1(1): 177-178 |
| |
| Authors: | ZHANG Jing LI Mao-qing |
| |
| Abstract: | Computing reachability matrix with traditional algorithm is a huge job. It's not adapted for hand calculation, neither for computer calculation. This paper imports the idea of transfer matrix and makes some improvement work for a complete, useable method to compute the reachability matrix. This method greatly decreases the calculation complexity. |
| |
| Keywords: | Adjacency Matrix Reachability Matrix Directed Graph |
| 本文献已被 CNKI 维普 等数据库收录！ |
