← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

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

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

ng to some other set, creates a new set whose only member (and thus representative) is x.

UNION(x, y) unites two disjoint, dynamic sets that contain x and y, say Sx and Sy, into a new set that is the union of these two sets. The representative of the resulting set is any member of Sx ∪ Sy, although many implementations of UNION specifically choose the representative of either Sx or Sy as the new representative. Since the sets in the collection must at all times be disjoint, the UNION operation destroys sets Sx and Sy, removing them from the collection S.

In practice, implementations often absorb the elements of one of the sets into the other

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea