Huffman Tree

Name: Huffman Tree
Works on: windows

Windows 7 and above

Developer: Rod Howell

Version: 1
Last Updated: 27 Feb 2017
Release: 18 Aug 2010
Category: Office tools > Other Office Tools

Rate this software:
139 downloads

View Screenshots(3)

Comments

Download

Liked it? Tell others:

Huffman Tree Tags

generate Huffman Tree Huffman Tree creator create Huffman Tree generator generate create creator

Huffman Tree Details

Works on: Windows 10 | Windows 8.1 | Windows 8 | Windows 7 | Windows 2012
SHA1 Hash: 8665f00b8d196f74fdbfbecfbb543496133f828b
Size: 20.98 KB
File Format: jar

Rating: 2.565217391 out of 5 based on 23 user ratings

Downloads: 139
License: Free

Huffman Tree is a free software by Rod Howell and works on Windows 10, Windows 8.1, Windows 8, Windows 7, Windows 2012.
You can download Huffman Tree which is 20.98 KB in size and belongs to the software category Other Office Tools.
Huffman Tree was released on 2010-08-18 and last updated on our database on 2017-02-27 and is currently at version 1.

Thank you for downloading from SoftPaz! Your download should start any moment now. It would be great if you could rate and share:

Rate this software:
Share in your network:

Huffman Tree Description

Huffman Tree is, as the name suggests a simple, easy to use, Java based application specially designed to help you create a Huffman Tree for a given string.
The input consists of a string provided either as text entered in the text field or as the contents of a specified file (the latter option is probably prohibited by the browser if the program is being run as an applet). Based upon this input, a Huffman tree is generated. This tree describes a varying-length binary encoding for each character in the input string such that the length of the encoded string is minimized.
The Huffman tree is displayed, along with a table giving, for each character in the string, its original encoding in hexadecimal (this helps to identify non-printing characters), its binary Huffman code, and its number of occurrences in the string.
The Huffman code actually describes the path from the root of the tree to the node containing the encoded character: a 0 represents an edge to a left child, and a 1 represents an edge to a right child.System requirementsJava

Huffman Tree Screenshots

Similar Software