基于关系矩阵的传递闭包求解方法  

Solving method of transitive closure based on relation matrix

作　　者：郭丽君 Guo Lijun(Telecommunication engineering department,Lanzhou Bowen college of science and technology,Lanzhou,Gansu 730101,China)

机构地区：[1]兰州博文科技学院电信工程学院,甘肃兰州730101

出　　处：《计算机时代》2022年第11期43-45,共3页Computer Era

基　　金：兰州博文科技学院2021年教育教学成果培育项目(2021BWJX011)。

摘　　要：提出一种通过关系矩阵及其运算求解关系的传递闭包的方法,在其求解过程中不用对关系中的有序偶做过多的判断和对比,也不必对元素进行筛选或删除,同时为进一步利用计算机编程求解关系的传递闭包提供了理论依据。A method for solving the transitive closure of relations by relation matrix and its operations is proposed.In the process of its solution,there is no need to make too many judgments and comparisons on the ordered pairs in the relationship,and it is not necessary to filter or delete the elements.It provides a theoretical basis for further using computer programming to solve the transitive closure of the relationship.

关 键 词：二元关系 传递闭包 关系矩阵 布尔运算 复合运算 

分 类 号：O241.6[理学—计算数学] O158[理学—数学]