离散数学课件5.4 Closures of Relations.pptVIP

When Algorithm 1 is used, the matrix of the transitive closure of a relation on a set with n elements can be found using 2n3(n-1) bit operations. p 271 However, the transitive closure can be found by Warshall’s algorithm using only 2n3 bit operations. P 273 Warshall’s algorithm Interior vertices内部节点: If a,x1,x2,…xm-1,b is a path, it’s interior vertices are x1,x2,…xm-1,that is ,all the vertices of the path that occur somewhere other than as the first and last vertices in the path. Warshall’s algorithm is based on the construction of a sequence of zero-one matrices.These matrices are W0, W1, … Wn, where W0=MR is the zero-one matrix of this relation,and Wk=[Wij(k)], where Wij(k) =1 if there is a path from vi to vj such that all the interior vertices of this path are in the set {v1,v2,…vk} and is 0 otherwise. Wn=MR*,since the (i,j)th entry of MR* is 1 iff there is a path from vi to vj with all the interior vertices in the set {v1,v2,…vn} . Example Let R be the relation with the given directed graph.Find the matrices W0,W1,W2,W3 and W4. Solution Let v1=a,v2=b,v3=c, v4=d .W0 is the matrix of the relation.Hence, W2=W1 W4 is the matrix of the transitive closure. LEMMA Let Wk=[Wij(k)] be the zero-one matrix that has a 1 in its(i,j)th posotion iff there is a path from vi to vj with interior vertices fron the set {v1,v2,…vk}.Then Whenever i,j,and k are positive integer not exceeding n. Warshall’s algorithm computes is the sequence of zero-one matrices W0, W1, … Wn=WR*, the total number of bit operations used is 2n3. Theorem: Let R be a binary relation on a nonempty set A. If R is reflexive, then s(R) and t(R) are reflexive. If R is symmetric, then r(R) and t(R) are symmetric. If R is transitive, then r(R) is transitive. Example Let R={(1,2),(3,2)}, R is transitive. s(R)={(1,2),(2,1),(3,2),(2,3)} is not transitive. Hence: st(R) ≠ ts(R) 1) Do the closure operations commute? ? Does st(R) = ts(R)? ? Does rt(R) = tr(R)? ? Does rs(R) = sr(R)? 2) Do the cl