| 基于设置复合位置的传递闭包算法 |
| |
| 引用本文： | 汪小燕.基于设置复合位置的传递闭包算法[J].铁道师院学报,2014(3):43-45. |
| |
| 作者姓名： | 汪小燕 |
| |
| 作者单位： | 安徽工业大学计算机科学与技术学院,安徽马鞍山243032 |
| |
| 基金项目： | 计算机软件新技术国家重点实验室开放课题基金资助项目（KFKT2010802）;安徽省高校自然科学基金资助项目（KJ2012Z024） |
| |
| 摘 要： | 二元关系的传递闭包根据定义有时不好计算,文中提出一种通过设置二元关系中序偶的复合位置,对被删减的二元关系按照序偶的复合位置,进行增量式复合来计算传递闭包的新算法,利用该算法可以较快地实现传递闭包的求解。
|
| 关 键 词： | 二元关系 传递闭包 恒等关系 复合位置 |
An algorithm for the transitive closure based on setting compound position |
| |
| WANG Xiaoyan.An algorithm for the transitive closure based on setting compound position[J].Journal of Suzhou Railway Teachers College(Natural Science Edition),2014(3):43-45. |
| |
| Authors: | WANG Xiaoyan |
| |
| Institution: | WANG Xiaoyan (School of Computer Science and Technology ,Anhui University of Technology, Ma ＇anshan 243032 ,＇China) |
| |
| Abstract: | There is difficulty in calculating the transitive closure of a binary relation according its definition. This paper proposes a new algorithm for the transitive closure by setting compound position of ordered pair in binary relations, incremental compound calculation being used in binary relations deleted according to the compound position of ordered pair. By this algorithm, the solution of the transitive closure can be achieved faster. |
| |
| Keywords: | binary relation transitive closure identity relations compound position |
| 本文献已被 维普 等数据库收录！ |
