离散数学杨争锋ch074.pptxVIP

Let R be the relation containing (a,b) if there is a telephone line from the data center a to that in b. How can we determine if there is some (possibly indirect) link composed one or more telephone lines from one center to another? Solution: We can find all pairs of data centers that have a link by constructing the smallest transitive relation that contains R. This relation is called the transitive closure (传递闭包) of R 牛牛文库文档分享 (2) The Closure of Relation R with Respect to Property P Let R be a relation on A. R may or may not have some property P, such as reflexive, symmetric, or transitivity. If there is a relation S with property P containing R such that S is a subset of every relation with property P containing R, then S is called the closure of R with respect to P. (可以page 555的第35题作业来加深理解) Why? 牛牛文库文档分享 2. Closures (1) Introduction 1 (reflexive closure) The relation R={(1,1), (1,2), (2,1), (3,2)}} on the set A={1,2,3} is not reflexive. How can we produce a reflexive relation containing R that is as small as possible? Solution: by adding (2,2), (3,3) to relation R. The new relation is called the reflexive closure of R. 牛牛文库文档分享 (2) Result 1 Let ∆={ (a,a) | a∈A}. It is called the diagonal relation (对角线的关系). The reflexive closure of relation R on set A R∪∆ Example 1 (page 545) What is the reflexive closure of the relation R={ (a,b) | ab } on the set of integers? Solution: R∪∆=…………={ (a,b) | a≤b } 牛牛文库文档分享 (3) Introduction 2 (symmetric closure) The relation { (1,1), (1,2), (2,2), (2,3), (3,1), (3,2) } on {1,2,3} is not symmetric. How can we produce a symmetric relation that is as small as possible and contains R? Solution: by adding (2,1) and (1,3). The new relation is called the symmetric closure of R. 牛牛文库文档分享 (4) Result 2 Let R-1={ (b,a) | (a,b)∈R } (关系R的逆关系). The symmetric closure of relation R is R∪R-1 Example 2 (page 497) W