| 二元关系传递闭包的求法及与图的可达矩阵的关系 |
| |
| 引用本文： | 郭键,师鸣若,辛向丽.二元关系传递闭包的求法及与图的可达矩阵的关系[J].黔南民族师范学院学报,2008,28(6):45-47. |
| |
| 作者姓名： | 郭键 师鸣若 辛向丽 |
| |
| 作者单位： | 1. 北京物资学院信息学院,北京,101149
2. 北京政法职业学院信息技术系,北京,100024 |
| |
| 摘 要： | 分析了几种求解二元关系传递闭包方法的特点，并利用二元关系传递闭包与有向图的可达性矩阵之间的关系，实现了采用Warshall算法对可达性矩阵的求取，简化了计算可达性矩阵的算法．
|
| 关 键 词： | 二元关系 传递闭包 可达性矩阵 WARSHALL算法 |
Relation Between Computing the Transitive Closure for Binary Relation and Reachability Matrix |
| |
| GUO Jian,SHI Ming-you,XIN Xiang-li.Relation Between Computing the Transitive Closure for Binary Relation and Reachability Matrix[J].Journal of Qiannan Normal College of Nationalities,2008,28(6):45-47. |
| |
| Authors: | GUO Jian SHI Ming-you XIN Xiang-li |
| |
| Institution: | GUO Jian ,SHI Ming- yuo ,XIN Xiang- li ( 1. Information school, Beijing Wuzi University, Beijing 101149, China; 2. The Dept. , of Information Techology,Beijing Management College of Politics and law,Beijing 100024,China) |
| |
| Abstract: | The characteristics of solutions about the transitive closure for binary relation are analyzed.By using the relation between it and reachability matrix of graph,Warshall algorithm is adopted to computing the reachability matrix,which simplifies the computing process. |
| |
| Keywords: | binary relation transitive closure reachability matrix Warshall algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
