搜索资源列表
huffman
- 利用哈夫曼编码进行通信可以大大提高信道的利用率，缩短信息传输的时间，降低传输成本。但是这要求发送端通过一个编码系统对待传数据预先编码，在接收端传来的数据进行译码。对于双工信道，每端都需要有一个完整的编／译码系统，试为这样的信息收发站编写一个哈夫曼的编／译码系统。-huffman tree algorithm
huffman
- 编写完整的系统，要求具有以下功能： 1、 I:初始化（Initialization）。从终端读入字符集大小n，以及n个字符和n个权值，建立哈夫曼树，并将它存入文件hfmTree中。 2、 E:编码(Encoding)。利用以建好的哈夫曼树（如不在内存，则从文件hfmTree中读入），对文件ToBeTran中的正文进行编码，然后将结果存入文件CodeFile中。 3、 D：译码(Decoding)。利用已建好的哈夫曼树将文件CodeFile中的代码进行译码，结果存入文件TextFile
AHC
- Adaptive-Huffman Coding自适应的Huffman压缩与解压缩。 在压缩与解压缩过程中动态地改变Huffman树，和编码。-Adaptive-Huffman Coding Adaptive Huffman compression and decompression. Compression and decompression in the process of changing the dynamic Huffman tree, and coding.
huffman
- 哈夫曼树构造，给出节点值，就能够获得构造过程-Huffman tree construction, given the node values can be constructed on the process of
huffman
- 二叉树 Huffman树 稀疏矩阵 中缀表达式计算 简单的堆栈操作 -Huffman tree binary tree is made up of sparse matrix expression in the stack is simple to operate
huffman
- 数据结构的一个重要知识点的练习，使我们对赫夫曼树有更好的理解-Data structure knowledge of an important point of practice, so that we Huffman tree for a better understanding
huffman
- A file containing source code of building huffman tree in C from an array.
tongji(1)
- 统计一篇英文中每个字符的个数，并作为权值建立赫夫曼树，翻译成代码文件，然后再译码-Statistics for each character in an English number and value as the right to establish a Huffman tree, translated into code files, and then decode
comparison
- Generate a Huffman Tree.
huffman
- 该压缩包是描述数据结构与算法中的哈弗曼树的Java源程序，可以直接导入Eclipse即可查看效果-The compressed packet is to describe data structures and algorithms in the Java source tree哈弗曼can be directly into Eclipse to see the effect of
huffman
- the application of tree on huffman
huffman
- 输入8个字符（数目可以自己设定，需要改动程序中N的值），注意空格也算字符，然后输入权值，会显示构造的霍夫曼树及每个字符的编码-Encode：enter 8 characters，then enter 8 numbers，this program will print the huffman tree and each char s code.
huffman
- 利用huffman编码实现小于4g文件的压缩，先用2进制读写将文件变为2进制码，再通过前缀码构造huffman树，最后存储huffman编码，解码过程反之。-Using huffman coding to achieve less than 4g file compression, first two to read and write binary file into 2 binary code, and then through the prefix code construct huffm
huffman
- JAVA哈弗曼算法，对初学者有帮组，其实哈弗曼树比较容易懂。-JAVA Havermann algorithm, there are help groups for beginners, in fact, relatively easy to understand Havermann tree.
Huffman
- Huffman树和编码 用结构体和链表完成-Huffman tree and code completion list with the structure and
HuffmanTree
- 简单的哈夫曼编码生成,测试数据固定，但生成算法是哈夫曼树及编码生成逻辑是通用的-Construct huffman tree and code
Huffman
- 包含哈夫曼树的构造过程，以及生成哈夫曼编码。-Contains the Huffman tree construction process, and generate the Huffman coding.
tree
- 本程序可以用三种方法建立二叉树，并实现相应功能。1、通过输入树的嵌套括号表示序列建立二叉树；2、根据前序遍历序列和中序遍历序列建立二叉树；3、建立哈夫曼树-This program can use three ways to establish a binary tree, and to achieve that function. 1, by entering the tree to establish a sequence of nested parentheses binary tree
huffman
- 赫夫曼编码译码器：能对指定的文本文件进行各字符出现频度分析，并建立哈夫曼树与哈夫曼编码，将该文本文件编码成目标文件 -Huffman codec: Can the specified text file to the frequency analysis of characters in there, and the establishment of Huffman Tree and Huffman encoding, the encoded text file into the desti
huffman
- 霍夫曼树的C++描述，对树的理解更加深刻，且算法经典-huffman tree