原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
r bound on the running time that is just barely superlinear. 19.1 Disjoint-set operations
A disjoint-set data structure maintains a collection S = {S1, S2,
… , Sk} of disjoint dynamic sets. To identify each set, choose a representative, which is
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea