An Encoder for Huffman tree using 3 priority queues - MinBinaryHeap, Min 4-AryBinaryHeap and PairingHeap. The encoder reads an input file that is to be compressed and generates two output files – the compressed version of the input file and the code table
-
Notifications
You must be signed in to change notification settings - Fork 0
An Encoder for Huffman tree using 3 priority queues - MinBinaryHeap, Min 4-AryBinaryHeap and PairingHeap. The encoder reads an input file that is to be compressed and generates two output files – the compressed version of the input file and the code table.
nikhilchopra60/HuffmanTreeEncoder
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An Encoder for Huffman tree using 3 priority queues - MinBinaryHeap, Min 4-AryBinaryHeap and PairingHeap. The encoder reads an input file that is to be compressed and generates two output files – the compressed version of the input file and the code table.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published