原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
he subtree rooted at each node, however, we’ll adopt an approach that eases the analysis.
For each node, maintain a rank, which is an upper bound on the height of the node. Union by rank makes the root with smaller rank point to the root with larger rank during a UNION operation.
The second heuristic, path compression, is also quite simple and highly effective. As sho
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea