📄 readme.txt
字号:
===============================================================================
Data Structures For Game Programmers
Ron Penton
Graphical Demonstration 22-2
===============================================================================
This demonstration shows you how to create a huffman tree based on a certain
string of text.
- Start off by typing a string of text into the text box.
- When you click Claculate, the program calculates the frequency of each letter,
converts them into nodes, and inserts them into a priority queue. The queue
is shown on the bottom of the screen.
- Click the Iterate button to iterate through the huffman tree creation process:
- Pick off the first node
- Pick off the second node
- Combine them with a new node, with a weight that is the sum of both children
- Add the new node back into the priority queue.
When the iteration is complete, the complete tree will be displayed from the
bottom-up. Large strings may end up causing the trees to be drawn all over
themselves; unfortunately there is no way to fix it, unless you have an ultra-
huge monitor, and recode the application for a higher resolution =).
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -