原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
into a set Kj, which is empty if Ij is empty. Then execute the OFFLINE-MINIMUM procedure.
OFFLINE-MINIMUM(m, n) 1 for i = 1 to n 2 determine j such that i ∈ Kj 3 if j ≠ m + 1 4 extracted[j] = i 5 let l be the smallest value greater than j for which set Kl exists 6 Kl = Kj ∪ Kl, destroying Kj 7 return extracted
b. Argue that the array extracted returned by OFFLINE-MINIMUM is correct. c. Describe how
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea