关系传递闭包计算的补充

COMPLIMENT OF THE COMPUTATION ON TRANSITIVE CLOSURE

设X是一n元集 ,R是X上的一个二元关系 ,该文给出了R中序偶链及其链长的定义 ,并据此找到了一个准确的k≤n使得t(R) =∪ki=1 Ri。

Let X be a set with n elements and R be a binary relation on X . The author gives the definitions of ordered pair chain and its length in R . According to these, the author can find a positive integer k≤n s.t. t(R)=∪ki=1R i, so the computation of t(R) is simplified.