Binary Huffman Coder
Recommendation |
Not Recommended |
||||
Link |
|||||
Delivery Method |
Java Applet |
||||
License |
Unavailable |
||||
Language |
English |
||||
Author |
Roberto Togneri |
||||
Institution |
University of Western Australia |
||||
Project |
|||||
Works |
Yes |
||||
Description |
Somewhat difficult-to-understand visualization of constructing a Huffman tree from frequencies. There is a bug related to floating point display, which makes the screen difficult to read. |
||||
Evaluation |
Extremely difficult to follow what is going on. At each step, you see which next two values are merged together. But the display doesn't show a tree, so it is hard to understand from the display how a tree would actually look. After all of the joins are made, codes are assigned. Again, it is hard to see why a given item gets a given code. |
||||
Step Control; Canned Data |
|||||
Nothing |
|||||
Screenshots |
|
||||
Videos |
|
||||
References |
|
||||
|
|||||
First Visited |
2006-04-18 |
||||
Last Visited |
2009-04-28 |
||||
Last Updated |
1997 |
||||
Topic |
|||||
Community |
|
||||
Edit |
You may edit this entry if you have an account. |
