原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
es b R a. Transitivity, therefore, implies a R a. Is the professor correct? B.3 Functions
Given two sets A and B, a function f is a binary relation on A and B such that for all a ∈ A, there exists precisely one b ∈ B such that (a, b) ∈ f. The set A is called the domain of
f, and the set B is called the codomain of f. We sometimes write f : A → B, and if (a, b)
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea