摘要
传统的由邻接矩阵求解可达矩阵的算法计算量很大，不适合手动计算，也没有提出相应的适合计算机的算法。这篇文章引入转移矩阵的概念．并在此基础上加以改进，形成一套完整的可行的求解可迭矩阵的方法。有效地减少了计算量。
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.
作者
张静
李茂清
ZHANG Jing,LI Mao-qing （Xia-men University,Xiamen 361005,China）
出处
《电脑知识与技术》
2007年第1期177-178,共2页
Computer Knowledge and Technology
关键词
邻接矩阵
可迭矩阵
有向图
Adjacency Matrix
Reachability Matrix
Directed Graph
