Description: 这是一个有关哈夫曼编码的软件,包括哈夫曼的编码和翻译.-A program shows how to implement the Huffman code contains encoding and decoding Platform: |
Size: 22812 |
Author:丁一 |
Hits:
Description: 这是一个有关哈夫曼编码的软件,包括哈夫曼的编码和翻译.-A program shows how to implement the Huffman code contains encoding and decoding Platform: |
Size: 607232 |
Author:丁一 |
Hits:
Description: 利用C++实现霍夫曼编码，阅读代码需要一定的C++STL知识。-Implement Huffman coding in C++, read the code requires a certain knowledge of C++ STL. Platform: |
Size: 2048 |
Author:罗雄威 |
Hits:
Description: 基于huffman算法的压缩/解压缩的程序源码。
Borland C++写的。
仅供参考学习，请勿作为盈利性程序。-Huffman compression code compressor and decompressor in Borland C++ 2.0
by Shaun Case, April 1991
Enclosed in this archive are two C programs that implement Huffman code
compression.
huf.c <--- compress a file using huffman compression
unhuf.c <--- decompress a file compressed with huf.c
Both programs, their source code and executable code, are in the public
domain. You may use either in any way you want. You can sell them, use
them in your own pd, freeware, shareware, or commercial application,
without fee, licsence, or royalty of any kind. You don t even have to
put my name on it, if you don t want to, although that would be a nice
touch.
You should know two things before using these programs:
1) I am completely unresponsible for any liability arising from use of
these programs, either in executable or source form. They are for use
as-is, without any kind of waranty or guarantee, including but not
limited to FITNESS FOR A PARTICULAR PURPOSE, or Platform: |
Size: 38912 |
Author: |
Hits:
Description: 运用哈夫曼编码实现的文件压缩源代码
功能：可以实现文件以二进制输入进行哈夫曼编码在写入另一个重建的文件中实现文件压缩-
File compressed source code implemented using the Huffman code
Functionality: you can implement files in binary input with the haffman encoding in a file that is written to another rebuild file
Platform: |
Size: 3566592 |
Author:苗 |
Hits:
Description: 功能1:使用一种树型结构来实现我们的单词计数功能——Trie树
功能2:Huffman树进行编码
程序输入：
第一行为一个正整数n，表示输入单词的总数。
接下来的n行，每行为一个单词，单词由不超过10个的小写英文字母组成。
接下来的一行为一个正整数m，表示查询的次数。
接下来的m行，每行为一个数字和一个查询，当数字为1时，查询为单词，输出该单词出现的次数（可以为0）；当数字为2时，查询为Huffman编码，输出对应的单词（该Huffman编码对应的单词确定存在）。(Function 1: Use a tree structure to implement our word counting function - Trie Trees:
Function 2: The Huffman tree is encoded
Program entry:
The first line is a positive integer n, which represents the total number of words entered.
The next n lines, each line of a word, the word by no more than 10 small letters written in English letters.
The next line is a positive integer m, indicating the number of queries.
The next m rows, each line of a number and a query, when the number is 1, the query for the word, the output of the word appears (can be 0); when the number 2, the query for Huffman coding, the corresponding output The word (the Huffman code corresponds to the word that exists).) Platform: |
Size: 2048 |
Author:functiondy_dx
|
Hits:
Description: 哈夫曼是著名的一种信源无损压缩方法，该程序可以实现哈夫曼信源编码,(Huffman is a well-known source lossless compression method, the program can implement the Huffman source code,) Platform: |
Size: 19456 |
Author:小明213 |
Hits:
Search - Huffman code implement