Description: The experiment will document the frequency of characters as nodes, each character appears in the file as a node weights, using Huffman algorithm Huffman tree structure, the character with the shortest possible representation of binary digits (the lower the frequency, binary digit longer), instead of storing 8-bit ASCII code, has been reached to save storage space, archive purposes.
To Search:
File list (Check if you may need any files):
huffman\Huffman1.cpp
.......\Huffman1.exe
.......\软件设计说明书.doc
.......\软件使用说明书.doc
huffman
Download