原书出处
Introduction to Algorithms, Fourth Edition
19 第19章 不相交集合的数据结构
where for i = 1, 2, … , m, extracted[i] is the key returned by the ith EXTRACT-MIN call.
The problem is “offline” in the sense that you are allowed to process the entire sequence S before determining any of the returned keys.
a. Consider the following instance of the offline minimum problem, in which each operatio
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter019.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea