Description: Huffman coding of the procedures for the use of Huffman coding to achieve data compression input string string sourceCode- To facilitate the understanding of the temporary request string contains only capital letters and spaces, if you like, can easily be extended to all the characters- the string is calculated in the weight of all the letters, and then its Huffman codes, Huffman tree output. Huffman tree leaves to node binary tree stored in an orderly manner, the output of the original string to be compressed by the use of' 0 ' and' 1' indicated that the new string destCode Huffman tree and then use the character destCode for decoding strings, string target objCode, compared objCode and sourceCode, found exactly the same! Codec success!
To Search:
- [HaffCode] - This procedure used to solve the data in
File list (Check if you may need any files):
hfmcpp.cpp
Download