摘要: 求n×n的模糊矩阵A的传递闭包的快速算法是:ai,j(1)=a:i,j,ai,j(p+1)=ai,jp∨(ai,p+1(p)∧pp+1,i(p))。本文证明(k≤n)
V…V
且ai,j(n)就是A的传递闭包t(A)的i行j列的元。
陈国祯. 传递闭包递推算法的解析表达式[J]. 重庆交通大学学报(自然科学版), 1991, 10(1): 11-17.
Chen Guozhen. An Analytic Expression of the Iterative Formula to Find the Transitive Closure of a Fuzzy Matrix[J]. Journal of Chongqing Jiaotong University(Natural Science), 1991, 10(1): 11-17.