A Java Project for displaying the Huffman Encoding Tree and decoding a bit string using the same
A Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding and/or using such a code proceeds by means of Huffman coding algorithm which derives the estimated probability or frequency of occurrence (weight) for each possible value of the source symbol.
- JavaFX for visualization
- Built-in PriorityQueue for implementing Min Heap (required to build encoding tree)
Firstly, install javaFX libraries in the system. Then run the following commands,
javac HuffmanTree.java
javac DisplaySimpleTree.java
java DisplaySimpleTree
Now you should be able to see the GUI.