传递闭包递推算法的解析表达式

An Analytic Expression of the Iterative Formula to Find the Transitive Closure of a Fuzzy Matrix

求n×n的模糊矩阵A的传递闭包的快速算法是:a_(i,j)^((1))=a:i,j,a_(i,j)^((p+1))=a_(i,j)~p∨(a_(i,p+1)^((p))∧a_(p+1,i)^((p)))。本文证明(k≤n)且a_(i,j)^((n))就是A的传递闭包t(A)的i行j列的元。

The iteratively faster algorithm to find the transitive closure of a fuzzy matrix A is as follows:We obtain and