原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
leaves and performs a sequence of |C | − 1 “merging” operations to create the final tree.
The algorithm uses a min-priority queue Q, keyed on the freq attribute, to identify the two least-frequent objects to merge together. The result of merging two objects is a new object whose frequency is the sum of the frequencies of the two objects that were merged.
HUFFMAN(C) 1 n = |C | 2 Q = C 3 for i = 1 to n − 1 4 allocate a new node z 5 x = EXTRACT-
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea