原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
ther than appending one list to another, splice them together.) 19.3 Disjoint-set forests
A faster implementation of disjoint sets represents sets by rooted trees, with each node containing one member and each tree representing one set. In a disjoint-set forest, illustrated in Figure 19.4(a), each member points only to its parent. The root of each tree contains the representative and is its own parent.
As we’ll see, although the straightforward algorithms that use this representation are no
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea