Introduction - If you have any usage issues, please Google them yourself
Annex to achieve data compression huffman basically, do not have the versatility. But it is a finished product through the packaging interface with MFC
Comparison also can make your reference,
Then the description of the file compression format: extension is ". Fm", documents the first two bytes are the letters "FM" (used to test file
Format), then the original file name length, the length of the original file again (decoding, decode statement to determine factors), followed by the original
File name, again yes yes 256 unsigned long data indicated that the original document number of occurrences of each letter (to re-establish
huffman tree), and finally the data that is encoded data.
Note that a few points, decoding if the. Fm files can, if the output file name is NULL, then automatically fill in file name,
Such as: a.txt compression generated a.fm.
In order to traverse the huffman tree wrote a stack, so only the efficiency of such problems is to consider the fo