Location:
Search - huffman tree
Search list
Description: huffman tree 问题描述：设一份电文中有不同出现频率的字符，为了提高电文的输入和翻译效率，必须有一套简短而又不会产生歧义的字符代码。试根据哈夫曼算法，对电文中的不同字符，构造出一棵哈夫曼树，对每个字符进行编码。-Huffman tree Problem description : Let a message different frequency of the characters, in order to enhance the input and message translation efficiency, we must have a brief but no ambiguity of the characters code. Examination under Huffman algorithm, the message of characters, construct a Huffman tree for each character coding.
Platform: |
Size: 9874 |
Author: 李明 |
Hits:
Description: 数据结构哈夫曼树-Huffman tree data structure
Platform: |
Size: 237568 |
Author: |
Hits:
Description: 一个关于数据结构哈夫曼编/译码的程序-Another Huffman tree coding Algorithm for Data Structure.
Platform: |
Size: 3072 |
Author: 周民 |
Hits:
Description: 用加权二叉树，最小堆和贪心算法实现的Huffman树，对学算法和数据结构的朋友很有帮助-weighted binary tree, the smallest reactors and the greedy algorithm Huffman tree for school algorithm and data structure of helpful friends
Platform: |
Size: 63488 |
Author: 张钊 |
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: huffman tree 问题描述：设一份电文中有不同出现频率的字符，为了提高电文的输入和翻译效率，必须有一套简短而又不会产生歧义的字符代码。试根据哈夫曼算法，对电文中的不同字符，构造出一棵哈夫曼树，对每个字符进行编码。-Huffman tree Problem description : Let a message different frequency of the characters, in order to enhance the input and message translation efficiency, we must have a brief but no ambiguity of the characters code. Examination under Huffman algorithm, the message of characters, construct a Huffman tree for each character coding.
Platform: |
Size: 9216 |
Author: 李明 |
Hits:
Description: 为得到使电文总长最短的二进制前缀编码，则以n种字符出现的频率作权，设计一棵Huffman树，求出给定权值的字符对应的Huffman编码。-enable the message to be chief of the shortest prefix binary coding, while the n characters of frequencies for the right to design a Huffman tree, obtained the right to set the value of the characters in the corresponding Huffman coding.
Platform: |
Size: 9216 |
Author: 张磊 |
Hits:
Description: 基于对话框的哈夫曼树演示系统
包含文件的操作，对话框画图-dialog on the Huffman tree demonstration system contains documents, the dialog Painting
Platform: |
Size: 1968128 |
Author: letterb |
Hits:
Description: hufferman的算法，构造huffman树二叉排序树，c语言-hufferman the algorithm, two tectonic Huffman tree fork Sort Tree, c Language
Platform: |
Size: 238592 |
Author: 马全 |
Hits:
Description: 哈夫曼树和哈夫曼编码：
从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。
设计要求：
⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例
⑵ 在程序中构造四个子程序为
① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/
② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/
③ void printhtree(HTree *t, int* path) /*中序打印树*/
④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/
-Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Print the tree in order*/④ void printcode (HTree* t)/* output of the Huffman coding characters* /
Platform: |
Size: 1024 |
Author: 秋 |
Hits:
Description: 哈夫曼树的建立和哈夫曼编码译码器。用C编写的。是学习数据结构的很好源代码-Huffman tree establishment and Huffman decoder. Prepared by C. Data structure is a good learning source code
Platform: |
Size: 2048 |
Author: 李阳 |
Hits:
Description: 1.构造对应的哈夫曼树
2.输出字符对应的哈夫曼编码
3.输入一串0 1代码，进行哈夫曼译码-1. Tectonic corresponding Huffman tree 2. Output characters corresponding Huffman 3. Enter the string 0 1 code, the Huffman decoding
Platform: |
Size: 280576 |
Author: 陈良 |
Hits:
Description: 哈夫曼编码：输入一个文本文件（英文文本），剔除其中的非英文字符，并将英文字符统一转化为大写字符，然后统计各个字符的出现概率。创建哈夫曼树，给出编码表（即各字符的码字）及编码效率（带权路径长度）-Huffman Coding: Enter a text file (English version), excluding one non-English characters and English characters converted to uppercase characters reunification, and then the emergence of statistical probability of the various characters. Create a Huffman tree, given encoding table (that is, the character code word) and the coding efficiency (with the right path length)
Platform: |
Size: 1024 |
Author: k332 |
Hits:
Description: 数据结构
1、算法思路：
哈夫曼树算法：a）根据给定的n个权值{W1，W2… ，Wn }构成 n棵二叉树的集合F={T1，T2…，T n }，其中每棵二叉树T中只有一个带权为W i的根结点，其左右子树均空；b）在F中选取两棵根结点的权值最小的树作为左右子树构造一棵新的二叉树，且置新的二叉树的根结点的权值为其左、右子树上结点的权值之和；c）F中删除这两棵树，同时将新得到的二叉树加入F中； d）重复b)和c),直到F只含一棵树为止。
-Data Structure 1, Algorithm idea: Huffman tree algorithm: a) in accordance with a given value of n of the right (W1, W2 ..., Wn) constitute a set of n binary tree trees F = (T1, T2 ..., T n) , which for each binary tree T with only one right for the W i of the root node, its about subtree are empty b) in the F 2 in the root node of the right to select the smallest value of the tree as a subtree structure around a new binary tree, binary tree and the new home of the root node of the right value for the left and right sub-tree nodes and the right value c) F in the deletion of the two trees, at the same time obtained by adding a new binary tree F in d) repeat b) and c), until a tree F containing only so far.
Platform: |
Size: 28672 |
Author: Anson |
Hits:
Description: 迄今为止见过的最方便的huffman编码，效率很高
一个外国人写的，很具有研究价值
Constructing a Huffman Tree according to the number of times each symbol appears in the data stream:
1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1).
2) Set the value of each node to the number of times that its symbol appears in the data stream.
3) Create a Minimum-Heap of N nodes.
4) Add every node whose value is greater than zero to the heap.
5) Extract the best two nodes in the heap.
6) Create a parent node whose children are the two extracted nodes.
7) Add the parent node to the heap.
8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap).
9) Extract the last node in the heap.
The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.
The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.-So far seen the most convenient huffman coding, efficient write a foreigner, I have research value Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes , representing N possible symbols (ranging between 0 and N-1) .2) Set the value of each node to the number of times that its symbol appears in the data stream.3) Create a Minimum-Heap of N nodes.4) Add every node whose value is greater than zero to the heap.5) Extract the best two nodes in the heap.6) Create a parent node whose children are the two extracted nodes.7) Add the parent node to the heap.8) Repeat the previous three steps N-1 times (until only 1 node remains in the heap) .9) Extract the last node in the heap.The array created in the first step stores the leaves of the tree, and is used in order to encode the data stream.The node extracted in the last step is in fact the root of the tree, and is used in order to decode the data stream.
Platform: |
Size: 17408 |
Author: 游弋人生 |
Hits:
Description: 一份huff_tc.c，只能在tc下运行，因为加入了用tc图形界面直观画出树形的代码。一份是huff_vc.c,是在vc和tc下都能运行的程序，没有直观表达编码的树形结构。
[目的]
构建所输入符号（及权值）的哈夫曼树，并利用该树求出各符号的编码，深入理解最优二叉树的概念及其特性。
[问题描述]
读入各个符号及其权值，求各符号的哈夫曼编码。
[基本要求]
（1）读入各个符号及其权值，建立哈夫曼树；
（2）利用建立的哈夫曼树对各符号进行编码，输出编码结果。
[选做内容]
将所建立的哈夫曼树以直观的方式（树或凹入形式的表）显示。
-huff_tc.c, can only run at tc, because using the add tc intuitive graphical interface to draw tree code [Objective] To construct the input symbols (and the right value) of the Huffman tree, and use the tree to derive the coded symbols, in-depth understanding of the concept of optimal binary tree and its characteristics. [Problem Description] read into the various symbols and their weights, and Huffman coding of the symbols. [Basic requirements] (1) read into the various symbols and their weights, Huffman tree set up (2) the use of the Huffman tree for the set up of the symbol encoding, output encoding results. [Does the content of the election] will be set up by the Huffman tree to intuitive way (tree or indentations in the form of the table) shows.
Platform: |
Size: 3072 |
Author: 李霄逍 |
Hits:
Description: Generate a Huffman Tree for an input String.
Platform: |
Size: 9216 |
Author: Naya Rangel |
Hits:
Description: 构造自适应霍夫曼树实现文件的压缩与解压缩。-Adaptive Huffman tree structure for file compression and decompression.
Platform: |
Size: 6144 |
Author: renyuanfang |
Hits:
Description: this is a huffman tr-huffman tree
Platform: |
Size: 74752 |
Author: wangwang |
Hits:
Description: 使用java语言编程，编写Huffman树的生成算法代码(Huffman tree generation)
Platform: |
Size: 4096 |
Author: kuailerensheng
|
Hits:
« 12
3
4
5
6
7
8
9
10
...
50
»