搜索资源列表
Huffman
- Huffman树 对输入的英文大写字母进行统计概率 然后构建哈夫曼树,输出是按照概率降序排序输出Huffman编码。 -Huffman tree on the input, uppercase letters and then build the statistical probability Huffman tree, the output is sorted in descending order according to the probability of the output
huffman
- 哈夫曼树实现文件的压缩和解压缩课程设计,开发环境:VC。内含有源文件、源代码和实验报告-Huffman tree for file compression and decompression of curriculum design, development environment: VC. Contains active files, source code and test reports
huffman
- 进行霍夫曼(Huffman)编码的实用C/C++程序,对于构建Huffman树的算法已经优化,可以在消耗内存最小的情况下提升编码速度. 对ASCII码字符串进行Huffman编码.-An C/C++ program that demonstrates how to construct a Huffman tree through which Huffman Code can be realized. The algorithm has been optimized to work under
Huffman
- 创建哈弗曼书,统计文本中单词出现的个数,实现哈弗曼编码和译码-Count the number of words by creating a huffman tree. Huffman coding and decoding
huffman
- Huffman编码的关键点是构造一棵Huffman树。其过程是: 1.输入各个叶子节点及其频率,对每个节点的lchild, rchild, parent分别赋初值为0; 2.选择parent为0,且fre最小的两个节点开始建Huffman树,再修改相应节点的lchild, rchild, parent值,如此重复直到Huffman树建立。 3.从叶子到根逆向求每个节点的Huffman编码。 4.解压时,由于Huffman编码是前缀编码,即任一字符的编码都不是
huffman.tar
- C++ 实现huffman树,和哈夫曼编码,实现对外部文件加密等功能 -Achieve huffman tree, and Huffman coding, to achieve document encryption
huffman
- 利用huffman树编写的文件压缩和解压程序,有MFC窗口-Prepared using the huffman tree file compression and decompression procedures, MFC window
Huffman
- 哈弗曼编码,构造哈夫曼树,构造哈夫曼树非常简单,将所有的节点放到一个队列中,用一个节点替换两个频率最低的节点,新节点的频率就是这两个节点的频率之和。这样,新节点就是两个被替换节点的父节点了。如此循环,直到队列中只剩一个节点(树根)。-Hoffman coding, Huffman tree structure, Huffman tree structure is very simple, all the nodes in a queue, replace the two lowest frequ
HUFFMAN
- 用C语言实现哈夫曼树的创建及哈夫曼编码的生成-Huffman tree using C language to create and generate Huffman
Huffman
- 赫夫曼树的建树,编码,解码代码。数据结构的必修内容-Huffman tree achievements, encoding, decoding codes. Data structures required content
Huffman
- 用mfc完成的哈夫曼树的功能 给出一组关键字,建立哈夫曼树,完成以下功能: (1)完成关键字来自于输入 (2)完成关键字来自于文本 (3)完成编码,显示编码结果 (4)画树-Completed using mfc Huffman tree function gives a set of keywords, the establishment of the Huffman tree, complete the following functions: (a) completio
tree
- 给出了树相关的源代码及多个例子,其中还包含哈夫曼树的相关代码。-Gives the source tree and a number of relevant examples, which also contains the relevant code Huffman tree.
Huffman-encoding
- 哈夫曼树可用于构造使电文的编码总长最短的编码方案。具体做法如下:设需要编码的字符集合为{d1,d2,…,dn},它们在电文中出现的次数或频率集合为{w1,w2,…,wn},以d1,d2,…,dn作为叶结点,w1,w2,…,wn作为它们的权值,构造一棵哈夫曼树,规定哈夫曼树中的左分支代表0,右分支代表1,则从根结点到每个叶结点所经过的路径分支组成的0和1的序列便为该结点对应字符的编码,我们称之为哈夫曼编码。-Huffman encoding can be used to construct the
Huffman
- 软件基础中的哈弗曼编码,包括哈弗曼树的构造,进行哈弗曼编码。-The Huffman coding software infrastructure, including the construction Huffman tree, carried Huffman coding.
HUFFMAN
- 哈弗曼树及其哈弗曼编码的实现及输出,包括输入,编码,输出等过程-Huffman tree and Huffman coding to achieve and output
Huffman
- Huffman树的应用,可对从文件中读入文章,对文章字母进行Huffman排列并输出,实现其功能。-Huffman tree applications can read articles from a file of articles and letters arranged Huffman outputs to achieve its function.
Huffman-algorithm-code
- 哈夫曼树是一种树形结构,用哈夫曼树的方法解编程题的算法就叫做哈夫曼算法。树并不是指植物,而是一种数据结构,因为其存放方式颇有点象一棵树有树叉因而称为树。 最简哈夫曼树是由德国数学家冯。哈夫曼 发现的,此树的特点就是引出的路程最短。 概念理解:1.路径 从树中一个节点到另一个节点之间的分支构成这两个节点之间的路径。2.路径长度 路径上的分支数目称作路径长度。-Huffman tree is a tree structure, Huffman tree algorithm method to sol
Huffman
- 用vs2013写的霍夫曼编码程序,可将.txt中的英文字符串(包括各种字符如:逗号)编码后输出到一个.txt中,并且可输出构建的霍夫曼树,保存编码方式。-Huffman coding using vs2013 to write programs in English can be txt string (including a variety of characters such as: the comma). Encoded output to a txt, and can output to
Huffman
- 实现霍夫曼编码和霍夫曼解码,并统计原文件中的各个字符出现的频率,将字符及其出现的频率保存至txt文件中,构建的霍夫曼树也将被保存至txt文件中。-Achieve Huffman coding and Huffman decoding and statistical frequency of each character in the original document that appears to save the characters and their frequency of occur
Huffman-Tree-and-Coding
- 哈夫曼树编码完整程序,编码主要是依照数据结构一书上的伪C代码,有调整,有完整-Huffman coding complete program, coding mainly in accordance with the data structure of a pseudo-C code book, there are adjustments, there is a complete