Description: Through the establishment of Huffman trees, will be key element such as " ABC" code as " 011001" form can also be carried out through the Huffman decoding tree, and the form of encoding the form of minimum spanning tree, that is the right value in case of encoding the length of the shortest.
To Search:
File list (Check if you may need any files):
赫夫曼编码
..........\赫夫曼编码.cpp
Download