原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
ractice, implementations often absorb the elements of one of the sets into the other set.
FIND-SET(x) returns a pointer to the representative of the unique set containing x.
Throughout this chapter, we’ll analyze the running times of disjoint-set data structures
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea