原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
s the object’s pointer back to its set object is updated. Consider a particular object x.
Each time x’s pointer is updated, x must have started in the smaller set. The first time x’s pointer is updated, therefore, the resulting set must have at least 2 members. Similarly, the next time x’s pointer is updated, the resulting set must have had at least 4 members.
Continuing on, for any k ≤ n, after x’s pointer has been updated ⌈lg k⌉ times, the result
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea