← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

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

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

ase running time using only the path-compression heuristic is Θ(n + f · (1 + log2+f/nn)).

Combining union by rank and path compression gives a worst-case running time of O(m α(n)), where α(n) is a very slowly growing function, defined in Section 19.4. In any conceivable application of a disjoint-set data structure, α(n) ≤ 4, and thus, its running time is as good as linear in m for all practical purposes. Mathematically speaking, however, it is superlinear.

Section 19.4 proves this O(mα(n)) upper bound. Exercises 19.3-1 Redo Exercise 19.2-2 usin

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea