Description: (1) to receive the raw data: Reading from the terminal into the character set size of n, n and n characters of the right value, the establishment of Huffman tree, stored in a document in hfmtree.dat. (2) Coding: Using the Huffman tree has been completed (such as not to memory, read from the document hfmtree.dat income) on the body of the document is encoded, and then the results into a document in codefile.dat. (3) Decoding: The Huffman tree has been built in the document codefile.dat code decoding, resulting in a document deposited in textfile.dat. (4) Print coding rules: that is, the characters one-to-one relationship with the coding. (5) Print Huffman tree: will have been in memory of the Huffman tree intuitive way to show that in terminal.
To Search:
- [Huffmaninternshipreport.Rar] - data structure Huffman internship report
- [hafum] - This is a C language prepared by the Huf
- [Huffmandecoding.Rar] - [basic requirements] a complete system s
- [TEA5757] - chip radio TEA5757 Drivers! I do not qui
- [ba] - err
- [huffman] - Huffman coding is optimal variable-lengt
- [libiconv1_11] - libiconv1.11 is a string encoding used t
- [tao] - A very perfect Huffman decoder have inte
File list (Check if you may need any files):
Download