原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
r an n-tuple by extending the set-theoretic definition for an ordered pair. B.2 Relations
A binary relation R on two sets A and B is a subset of the Cartesian product A×B. If (a, b) ∈ R, we sometimes write a R b. When we say that R is a binary relation on a set A, we
mean that R is a subset of A × A. For example, the “less than” relation on the natural nu
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea