Introduction
This program simply compresses any files with any size using Huffman compression method. To use this program, you can download and modify its code by your own desires.
Background
This program uses a heap for insertion and finding minimum elements and a tree to create each character's Huffman string, then reads characters from a file and puts each character's string into the buffer. Then for each 8 bits (from the buffer), creates a byte and then puts that byte into the file's buffer when the buffer of bits is full. When the file's buffer is full, the program writes all of the characters into the file until the last character of the file is read. To decompress, the file reads counts of character from the zipped file(a signature used for this) and then creates the Huffman tree, then reads each character from the file and decides for each bit how to move over the Huffman's tree. Then when it reaches a leaf, it puts its character into the file's buffer and when the file's buffer is full, the program writes the characters to the file so you can simply use it to compress any file.
Using the Code
I've implemented this program using most of good C++ tools such as STL, Linked List.. a buffer is set to hold the file's characters so the program runs faster.
I've written comments for each line and tried to make it easy for you to use the program.
Hope you guys enjoy it.
History
This is version 1.0 of this program
Update: The earlier version had a problem with some machines, so I had it fixed! If you still have any problem with running this new Huffman.exe file, please let me know by sending email to software.programmin@yahoo.com and I'll be happy to hear your advice ;)
Copyright © 2007. Using this program is allowed just by mentioning my name, something like this:
"Programmed by Alireza Noori"
