原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
bers of y’s list join x’s list, the UNION operation destroys the set object for y’s list.
The UNION operation is where this implementation pays the price for FIND-SET taking constant time: UNION must also update the pointer to the set object for each object originally on y’s list, which takes time linear in the length of y’s list.
In Figure 19.2, for example, the operation UNION(g, e) causes pointers to be updated in t
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea