EECS 233 (Data Structures) Project - Compress .txt files using Huffman Compression
Huffman coding uses a specific method for choosing the representation for each symbol, resulting in a prefix code (sometimes called "prefix-free codes", that is, the bit string representing some particular symbol is never a prefix of the bit string representing any other symbol). Huffman coding is such a widespread method for creating prefix codes that the term "Huffman code" is widely used as a synonym for "prefix code" even when such a code is not produced by Huffman's algorithm.
Clone the repository using git clone https://github.com/kclejeune/HuffmanCompressor.git, and then naviage to the repository with cd HuffmanCompressor.
In its present form, the project will create an encoded file based on an input file and encoding file. You can build all necessary files with:
javac /src/*.java
To run it, use:
java src/HuffmanCompressor inputFile encodingFile outputFile
Note: In general, the input file and encoding file will be the same.