← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

19 第19章 不相交集合的数据结构

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.714Z

node x after q operations: We next investigate some useful properties of node potentials.

Lemma 19.8 For every node x, and for all operation counts q, we have 0 ≤ ϕq(x) ≤ α(n) · x.rank.

Proof If x is a root or x.rank = 0, then ϕq(x) = α(n) · x.rank by definition. Now suppose

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea