Abstract: The iteratively faster algorithm to find the transitive closure of a fuzzy matrix A is as follows:a_i,j⁽¹⁾=a:i,j,a_i,j^(p+1)=a_i,j^p∨(a_i,p+1^(p)∧a_p+1,i^(p))We obtain  V…V  and prove A^(#)=t(A

Key words: transitive closure of a fuzzy matrix, iteratively faster algorithm, analytic expression

摘要： 求n×n的模糊矩阵A的传递闭包的快速算法是:a_i,j⁽¹⁾=a:i,j,a_i,j^(p+1)=a_i,j^p∨(a_i,p+1^(p)∧p_p+1,i^(p))。本文证明(k≤n)V…V且a_i,j⁽ⁿ⁾就是A的传递闭包t(A)的i行j列的元。

关键词: 传递闭包, 快速递推算法, 解析表达式