Description: huffman产生哈夫曼编码的源代码. ... generate huffman code //i present the i th code, j present from leaf to root in huffman tree //hfdata ... 第3 楼 一种思想。-Huffman coding produce the source code. Generate Huffman code ... / / i present the i th code, j present from leaf to root in Huffman tree / / ... hfdata first floor of a three ideas. Platform: |
Size: 1520 |
Author:yl |
Hits:
Description: huffman产生哈夫曼编码的源代码. ... generate huffman code //i present the i th code, j present from leaf to root in huffman tree //hfdata ... 第3 楼 一种思想。-Huffman coding produce the source code. Generate Huffman code ...// i present the i th code, j present from leaf to root in Huffman tree// ... hfdata first floor of a three ideas. Platform: |
Size: 1024 |
Author:yl |
Hits:
Description: 是一个用哈夫曼树生成哈夫曼编码的程序，并且既能编码，也能解码。-Is a Huffman tree used to generate Huffman coding procedure, and not only coding, but also to decode. Platform: |
Size: 294912 |
Author:刘兴民 |
Hits:
Description: HuffmanTree_code
哈夫曼树的定义及存储；哈夫曼树的构造；哈夫曼编码的生成。
调试了很久，基本没有bug了，如果遇到什么问题，请发邮件至horsewhite32@hotmail.com,笔者将不胜感激
uuhorse-Huffman tree HuffmanTree_code the definition and storage Huffman tree structure Huffman encoding to generate. Debugging for a long time, basically there is no bug, if any problems, please e-mail horsewhite32@hotmail.com, I would be grateful uuhorse Platform: |
Size: 8192 |
Author:uuhorse |
Hits:
Description: 用Java实现的求哈夫曼树算法，包括生成哈夫曼树的详细过程。-Using Java in order to realize Huffman tree algorithms, including Huffman tree to generate the detailed process. Platform: |
Size: 1024 |
Author:周建勇 |
Hits:
Description: ) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
-) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
Platform: |
Size: 1024 |
Author:ria |
Hits:
Description: 包含哈夫曼树的构造过程，以及生成哈夫曼编码。-Contains the Huffman tree construction process, and generate the Huffman coding. Platform: |
Size: 163840 |
Author:wang |
Hits:
Description: 构造霍夫曼树 //////////////////////
//根据权重生成霍夫曼树
//weight 权重数组
//n 权重数组长度
//NewTree 新生成的霍夫曼树
void createHFMTree(int* weights,int n,BinaryTree<int>& NewTree)
{
//初始化堆
MinHeap<BinaryTree<int> > heap(n)
int i=0
for( i<n i++){
heap.Insert(BinaryTree<int>(weights[i]))
}
//选择堆中根数值较小的两棵树，组成一棵新树然后插入堆里，并把原来的两棵树从堆里删除-Construct the Huffman tree//////////////////////// to generate Huffman tree// weight weights array// n weights array length// NewTree weight new Huffman tree generated void createHFMTree (int* weights, int n, BinaryTree <int> & NewTree) {//initialize heap MinHeap <BinaryTree<int> > Heap (n) int i = 0 for ( i <n i++){
heap.Insert(BinaryTree<int> (Weights [i])) }// Select heap root smaller value of the two trees, and then inserted into the pile to form a new tree and two trees removed from the pile Platform: |
Size: 3072 |
Author:kimikami |
Hits:
Description: 霍夫曼编码，霍夫曼编码就是通过构造霍夫曼树来生成前缀码的过程-Huffman coding, Huffman coding is by constructing a Huffman tree to generate the prefix code Platform: |
Size: 139264 |
Author:王 |
Hits:
Description: 能够快速的生成哈弗曼树和哈弗曼代码，源代码简单易懂-Able to quickly generate the Huffman tree and the Huffman code, source code is easy to understand Platform: |
Size: 1024 |
Author:郭涛 |
Hits:
Description: 哈夫曼树相关程序，利用哈夫曼（最优树）的原理，实现编码译码的实例之一。本程序包括，按给定字母频率生成编码表，编码、译码过程。-Huffman tree associated procedures, the use of Huffman (optimal tree) in principle, to achieve one instance of coding and decoding. The program includes, at a given frequency to generate the letter coding table, encoding, decoding process. Platform: |
Size: 335872 |
Author:cian |
Hits:
Description: 给出节点及节点上的值，生成huffman树，并输出结果-Give the value of the node, generate the Huffman tree, and output the results. Platform: |
Size: 193536 |
Author:keii |
Hits:
Description: 利用哈夫曼树生成哈夫曼编码，并实现字符串的压缩和编码的解压。(Huffman tree is used to generate Huffman coding, and the compression and decompression of the string are realized.) Platform: |
Size: 31217664 |
Author:你个肥仔 |
Hits:
Search - generate huffman tree