原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
1, S2, … , either finite or infinite, is a set of sets, in which each member is a set Si.
A collection S = {Si} of nonempty sets forms a partition of a set S if the sets are pairwise disjoint, that is, Si, Sj ∈ S and i ≠ j imply Si ∩ Sj = Ø, their union is S, that is,
In other words, S forms a partition of S if each element of S appears in exactly one set
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea