原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
efinition (19.2) of α(n)) > x.p.rank (by Lemma 19.6), which implies that level(x) < α(n).
For a given nonroot node x, the value of level(x) monotonically increases over time. Why? Because x is not a root, its rank does not change. The rank of x.p monotonically increases over time, since if x.p is not a root then its rank does not change, and if x.p is a root then its rank can never decrease.
Thus, the difference between x.rank and x.p.rank monotonically increases over time. There
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea