English
资源说明：Huffman compression technique
HuffmanCoding
=============
Huffman Coding is an algorithm technique for compression/decompression.
This is my take on it in python. In the Huffman.py file I do the encoding with out
python's heapq module and in the HuffHeapq.py file I get the encoding done with, yup you
guessed it, pythons heapq module.
While they both work great you can see how much cleaner the code is with the heapq module.
###Example:
python main.py -e
Do you want to use data read from a file y/n?: n
Data to compress: this is an example of a huffman tree
Huffman Tree...
[36, [16, [8, ('a', 4), ('e', 4)], [8, [4, ('i', 2), ('h', 2)], [4, ('m', 2), ('n', 2)]]], [20, [8, [4, ('s', 2), ('t', 2)], [4, [2, ('l', 1), ('o', 1)], [2, ('p', 1), ('r', 1)]]], [12, [5, [2, ('u', 1), ('x', 1)], ('f', 3)], (' ', 7)]]]
Key-Map...
{'a': '000', ' ': '111', 'e': '001', 'f': '1101', 'i': '0100', 'h': '0101', 'm': '0110', 'l': '10100', 'o': '10101', 'n': '0111', 'p': '10110', 's': '1000', 'r': '10111', 'u': '11000', 't': '1001', 'x': '11001'}
Encoded data stream...
['1001', '0101', '0100', '1000', '111', '0100', '1000', '111', '000', '0111', '111', '001', '11001', '000', '0110', '10110', '10100', '001', '111', '10101', '1101', '111', '000', '111', '0101', '11000', '1101', '1101', '0110', '000', '0111', '111', '1001', '10111', '001', '001']
Encoded string...
100101010100100011101001000111000011111100111001000011010110101000011111010111011110001110101110001101110101100000111111100110111001001
* * *
python main.py -d
Provide a key-map to read: {'a': '000', ' ': '111', 'e': '001', 'f': '1101', 'i': '0100', 'h': '0101', 'm': '0110', 'l': '10100', 'o': '10101', 'n': '0111', 'p': '10110', 's': '1000', 'r': '10111', 'u': '11000', 't': '1001', 'x': '11001'}
Data stream to decompress: ['1001', '0101', '0100', '1000', '111', '0100', '1000', '111', '000', '0111', '111', '001', '11001', '000', '0110', '10110', '10100', '001', '111', '10101', '1101', '111', '000', '111', '0101', '11000', '1101', '1101', '0110', '000', '0111', '111', '1001', '10111', '001', '001']
Decoded data...
this is an example of a huffman tree
本源码包内暂不包含可直接显示的源代码文件，请下载源码包。
