原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
eq + y.freq. Let T′ be any tree representing an optimal prefix-free code for alphabet C′.
Then the tree T, obtained from T′ by replacing the leaf node for z with an internal node having x and y as children, represents an optimal prefix-free code for the alphabet C.
Proof We first show how to express the cost B(T) of tree T in terms of the cost B(T′) of
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea