原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
e procedure must update the pointer to the set object for each member of the longer list.
Suppose instead that each list also includes the length of the list (which can be maintained straightforwardly with constant overhead) and that the UNION procedure always appends the shorter list onto the longer, breaking ties arbitrarily.
With this simple weighted-union heuristic, a single UNION operation can still take Ω(n) t
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea