搜索资源列表
1.huffman-CPP
- huffman algorithm in C-huffman algorithm in C++
Huffman
- 实现了Huffman算法，能够输出一个字符串序列对应的每个自字符对应的Huffman编码值01串。-The file implements the Huffman algorithm in C++ ,which will output a sequence of strings corresponding to the frequency of each character in the string to the Huffman coding since the character corre
HUFFMAN
- 数据结构之HUFFMAN算法， 数据结构之HUFFMAN算法-The data structure HUFFMAN algorithms, data structures HUFFMAN algorithms, data structures, the HUFFMAN algorithm of
huffman
- bmp图像压缩 用哈夫曼算法实现的哦 很好用-bmp image compression with Huffman algorithm achieved good use
huffman
- VC++基于哈弗曼算法的一个压缩和解压的VC例子，可视界面操作，可方便运用到程序里面。--VC++ based on the Huffman algorithm VC example of a compression and decompression, visual interface operation, can be easily applied to the program inside.
Huffman(win32)
- 使用哈夫曼算法实现的文本压缩工具。具有图形界面。-Huffman algorithm used for text compression tool. With a graphical interface.
Huffman
- 基于Huffman算法的简单c++文件编码和解码，适合初学者学习，对于输入的一串字符简单的压缩并解压-Simple c++ document encoding and decoding based on Huffman algorithm, suitable for beginners to learn, to
Huffman
- 数据结构实验之哈夫曼算法，欢迎下载指正。带有可执行程序-Experimental data structure of the Huffman algorithm.Welcome to download correction. With an executable program
Floyed-Huffman-prim
- 算法设计与分析课程中常用的一些算法，包括Floyed算法，Huffman算法、prim算法，单源最短路径算法，分数背包问题-Algorithm Design and Analysis course some commonly used algorithms, including Floyed algorithm, Huffman algorithm, prim algorithm, single-source shortest path algorithm, fractional knapsac
Image Huffman Compression
- Image compression based on Huffman algorithm
Huffman
- this code helps us to compress a text using huffman algorithm
huffman
- huffman algorithm can be used for compression data in matlab program
huffman
- Huffman算法是一种用来构造最优前缀码（Huffman编码）的贪心算法,java实现-Huffman algorithm is a kind of used to construct the optimal prefix code greedy algorithm (Huffman coding), the Java implementation
Huffman
- 利用Huffman算法实现的简单压缩程序，可以压缩各种格式的文件。-Use Huffman algorithm to compress various files.
huffman
- 基于Huffman编码的文件压缩设计:本次实验将文件中的字符作为结点，每个字符在文件中出现的频率作为结点的权值，采用Huffman算法构造Huffman树，将字符用尽可能短的二进制数位表示（频率越低，二进制数位越长），而不是用8位的ASCII码进行存储，已达到节省存储空间，压缩文件的目的。 程序设计的步骤如下： 1、统计需压缩文件中每个字符出现的频率； 2、将每个字符出现的频率作为叶子结点构建Huffman树，然后将树中结点引向其左孩子的分支标“0”，引向其右孩子的分支标“1”；
Huffman-coding-and-decoding
- 输入一组数据，并基于哈夫曼算法进行编码，显示，然后基于哈弗曼编码的算法进行解码并且显示-Enter a set of data, and based on the Huffman algorithm for encoding, display, and then based on the Haverman coding algorithm to decode and display
哈弗曼
- 哈夫曼算法的简单功能实现，主要用于算法原理理解(Huffman algorithm, simple function implementation)
parctice3
- 一个简单的基于huffman算法的压缩程序(A simple compression algorithm based on Huffman algorithm)
huffman
- 基于赫夫曼树的压缩算法 二进制读入文件，对txt有较好压缩效果，而对MP4、pdf等已经被处理过的文件格式效果不不明显。但是是初学者很好的学习资料。(The compression algorithm based on Huffman tree Binary read into the file, TXT has a better compression effect, and MP4, PDF has been processed file format effect is not not
Huffman
- Huffman coding is a lossless data compression algorithm. Huffman coding uses variable length code to represent a symbol of the source (eg a character in a file). The code is determined from an estimate of the probabilities of appearance of the source