| 基于被删减二元关系的可达性矩阵求解 |
| |
| 引用本文： | 汪小燕.基于被删减二元关系的可达性矩阵求解[J].铁道师院学报,2014(1):67-69. |
| |
| 作者姓名： | 汪小燕 |
| |
| 作者单位： | 安徽工业大学计算机科学与技术学院,安徽马鞍山243032 |
| |
| 基金项目： | 计算机软件新技术国家重点实验室开放课题基金资助项目（KFKT2010802）;安徽省高校自然科学基金资助项目（KJ20122024） |
| |
| 摘 要： | 利用邻接矩阵求解有向图的可达性矩阵，计算量大，提出将有向图表达成二元关系，忽略环和回路的处理，通过计算被删减二元关系的传递闭包来求解可达性矩阵，利用新方法可以较快地实现可达性矩阵的求解。
|
| 关 键 词： | 二元关系 传递闭包 可达性矩阵 邻接矩阵 |
Solving the reachability matrix based on binary relation deleted |
| |
| WANG Xiaoyan.Solving the reachability matrix based on binary relation deleted[J].Journal of Suzhou Railway Teachers College(Natural Science Edition),2014(1):67-69. |
| |
| Authors: | WANG Xiaoyan |
| |
| Institution: | WANG Xiaoyan (School of Computer Science and Technology, Anhui University of Technology, Ma＇ anshan 243032, China) |
| |
| Abstract: | Using adjacency matrix to solve reachability matrix of a directed graph needs a large amount of calcu-lation. This paper has proposed a new method. The directed graph is expressed by binary relation. The processing for rings and circuits is ignored. The solution is obtained through the calculation of transitive closure of binary relation deleted. The results show that the solution of the reachability matrix can be achieved faster with the new method. |
| |
| Keywords: | binary relation transitive closure reachability matrix adjacency matrix |
| 本文献已被 维普 等数据库收录！ |
