This program is a Huffman Tree Implementation: 1- It takes the input from a file 2- Construct a frequency table for the different characters the input is composed of 3- Based on the frequency table, it creates a Huffman tree and a bitmap 4- Using the Bitmap, it encodes the input 5- Then, decode it again... Which means your input and output file have to be exactly the same ; otherwise, there is something wrong going on
-
Notifications
You must be signed in to change notification settings - Fork 0
This program is a Huffman Tree Implementation: 1- It takes the input from a file 2- Construct a frequency table for the different characters the input is composed of 3- Based on the frequency table, it creates a Huffman tree and a bitmap 4- Using the Bitmap, it encodes the input 5- Then, decode it again... Which means your input and output file …
NorhanAbbas/Huffman-Tree
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This program is a Huffman Tree Implementation: 1- It takes the input from a file 2- Construct a frequency table for the different characters the input is composed of 3- Based on the frequency table, it creates a Huffman tree and a bitmap 4- Using the Bitmap, it encodes the input 5- Then, decode it again... Which means your input and output file …
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published