原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
T procedure with path compression, implemented recursively, turns out to be quite simple.
The FIND-SET procedure is a two-pass method: as it recurses, it makes one pass up the find path to find the root, and as the recursion unwinds, it makes a second pass back down the find path to update each node to point directly to the root.
Each call of FIND-SET(x) returns x.p in line 3. If x is the root, then FIND-SET skips lin
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea