搜索资源列表
构建哈夫曼树
- 利用C语言构建哈夫曼树 能够模拟哈夫曼树的构建过程，对理解有帮助-C language Construction Huffman tree to simulate the Huffman tree building process, help to understand
Java环境下的哈弗曼树构建
- Java语言实现的哈弗曼树构建
HFMBM
- 该程序实现哈夫曼树的构建，编码，具备简单的译码功能-The program realization of Huffman tree construction, encoding, decoding functions have simple
hafuman2
- 此霍夫曼编码可根据自己输入的字符集及频度构建霍夫曼树，利用建好的哈夫曼树生成哈夫曼编码．-This Huffman code can be entered in accordance with their own character set and the frequency of Huffman tree constructed using built Huffman tree generated Huffman.
huffman
- 一份huff_tc.c，只能在tc下运行，因为加入了用tc图形界面直观画出树形的代码。一份是huff_vc.c,是在vc和tc下都能运行的程序，没有直观表达编码的树形结构。 [目的] 构建所输入符号（及权值）的哈夫曼树，并利用该树求出各符号的编码，深入理解最优二叉树的概念及其特性。 [问题描述] 读入各个符号及其权值，求各符号的哈夫曼编码。 [基本要求] （1）读入各个符号及其权值，建立哈夫曼树； （2）利用建立的哈夫曼树对各符号进行编码，输出编码结果。 [
Huffman
- 哈弗曼树的构建 左子树为较小者，右子树为较大者-The struction of HuffmanTree
HUFFMAN
- 建树函数 构建哈夫曼树的目的一是为了得到哈夫曼编码表，二是为了压缩文件解压缩时使用，所以哈-Achievements of the purpose of the function first, building Huffman Huffman coding table to obtain the second is to extract the compressed file to use, so ha
Huffman
- 输入字符以及对应的概率权值，构建哈夫曼树；通过程序计算出哈夫曼编码并输出结构-Enter the characters and the corresponding probability weights to construct the Huffman tree Huffman calculated by the program and output structure
huffman-(2)
- 可以使用的huffman压缩器。通过构建huffman树的方法来进行文件压缩。-You can use the huffman compressor. By building huffman tree approach to file compression.
Huffman
- 哈弗曼树的构建以及哈弗曼编码的实现，采用C语言实现-Huffman code and tree
Huffman
- 用基于有堆排序的优先队列构建Huffman树，进行Huffman编码，实现文件压缩、解压缩。-Used to build the Huffman tree based on the priority queue have heapsort, Huffman encoding, file compression, decompression.
hfm2
- 哈夫曼树的构建，源码实现，可用于排序等功能的实现-the implement of Huffman
1
- 哈夫曼树的构建，正版算法，将一段文字自动编码为相应的01码，构建一棵哈夫曼树来实现-Huffman tree construction, genuine algorithm, a paragraph of text automatically encoded as the corresponding 01 yards to build a Huffman tree
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
- Huffman压缩的全部代码实现，包括Huffman树的构建代码和Huffman编码的实现和获取，以及压缩和解压缩的文件读写，包括界面的实现，完整的实现了Huffman压缩-Huffman compression to achieve all the code, including the building code Huffman tree and Huffman coding implementation and acquisition, as well as compression and
Huffman-tree
- 哈夫曼树的构建，遍历，编码，及求加权路径，代码简单修改方便-Construction, Huffman tree traversal, coding, and compute the weighted path, code simple and easy to modify
HuffmanTree
- 该源文件为赫夫曼树的构建和使用,是数据结构课程中的一个例子-The source files for building and using Huffman tree is a data structure of an example of a curriculum
HUFFMAN
- 利用得到的权值构建huffman树、并输出每个字符对应的huffman编码，另外动态演示该哈夫曼树的生成过程。-Right to use the output value to construct the Huffman tree, and each character corresponding Huffman encoding, and dynamic display the generation process of the Huffman tree .
huffman
- 基于Huffman编码的文件压缩设计:本次实验将文件中的字符作为结点，每个字符在文件中出现的频率作为结点的权值，采用Huffman算法构造Huffman树，将字符用尽可能短的二进制数位表示（频率越低，二进制数位越长），而不是用8位的ASCII码进行存储，已达到节省存储空间，压缩文件的目的。 程序设计的步骤如下： 1、统计需压缩文件中每个字符出现的频率； 2、将每个字符出现的频率作为叶子结点构建Huffman树，然后将树中结点引向其左孩子的分支标“0”，引向其右孩子的分支标“1”；
Huffman树
- 数据结构中的huffman树，构建一个Huffman树，并实现huffman编码和译码。(building a huffman tree)