文件名称:HuffmanTreeDoc
介绍说明--下载内容均来自于网络,请自行研究使用
设一段电文中有不同出现频率的字符,为了提高电文的输入和翻译效率,必须有一套简短而又不会产生歧义的字符代码。试根据哈夫曼算法,对电文中的不同字符,构造出一棵哈夫曼树,对每个字符进行编码。-Set a message in the frequency of different characters, in order to enhance the message of the input and translation efficiency, we must have a brief characters without ambiguity code. Trial under the Huffman algorithm, the message of the different characters, a Huffman tree is constructed for each character is encoded.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
HuffmanTreeDoc.doc