搜索资源列表
huajdj
- 哈夫曼树中,树的带权路径长度的含义是各个字符的码长与其出现的此时的乘积和, 也就是电文的代码总长,所以采用哈夫曼树构造的编码是一种能使电文代码总长最短的 不等长编码。-Huffman tree. tree with the right path length is the meaning of the various characters code length of time with the product and, is the message code chief Therefo
2
- 构造霍夫曼树，该压缩包包含该算法的源代码。。 是本人的实验代码，原创来的-Huffman tree construction, the compressed packet contains the source code of the algorithm. . Is my experimental code, original come. . .
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 charact
HuffmanTree
- 哈弗曼数基本算法，通过哈弗曼树的生成等，以代码形式阐述哈弗曼树-Havermann number of the basic algorithm, Huffman tree generation, code form elaborate Havermann tree
huffman-source-code
- hufferman 霍夫曼编码 经典算法 代码实现-hufferman codeing