Final exam of "Data Structures and Algorithms in Java" class. Codes were modified from original one for publishing on the public place.
-
Updated
Aug 23, 2016 - Java
Final exam of "Data Structures and Algorithms in Java" class. Codes were modified from original one for publishing on the public place.
Huffman Encoder-Decoder
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.
A decoder for Huffman Tree.
A small implementation of Huffman encoding and decoding in Java
A Java implementation of encoding and decoding Huffman tree
An implementation of huffman tree encoding and decoding schema using different data structures
given a .txt file, it uses the huffman algorithm to encode the characters that compose the file into a sting of 0s and 1s based on character frequency. frequent characters use less space while rare characters use more.
Huffman Algorithm
Create files with Huffman Encodings based on input and compression files
Implementación del algoritmo de Huffman con un Heap binario
Mini project on Image Compression and Decompression
Takes a text file as input and compresses it by encrypting the data. The data can be recovered without any loss on decoding.
Text File Huffman Compression
Huffman coding compression algorithm in Java.
A text compressor that uses huffman tree
Huffman Tree encoder for Algorithms and Data Structures II class
Add a description, image, and links to the huffman-tree topic page so that developers can more easily learn about it.
To associate your repository with the huffman-tree topic, visit your repo's landing page and select "manage topics."