二元关系的传递闭包根据定义计算时存在缺陷,文中提出一种计算传递闭包的新算法,利用该算法可以较快地实现传递闭包的求解。
There is one drawback in calculating the transitive closure of a binary relation according its definition.The paper proposes a new algorithm for computing transitive closure.With this algorithm,the solution of the transitive closure can be achieved faster.