Search - generate huffman tree

Search - generate huffman tree - List

[Data structs] HuffmanTree_Code DL : 0: HuffmanTree_code 哈夫曼树的定义及存储；哈夫曼树的构造；哈夫曼编码的生成。调试了很久，基本没有bug了，如果遇到什么问题，请发邮件至horsewhite32@hotmail.com,笔者将不胜感激 uuhorse-Huffman tree HuffmanTree_code the definition and storage Huffman tree structure Huffman encoding to generate. Debugging for a long time, basically there is no bug, if any problems, please e-mail horsewhite32@hotmail.com, I would be grateful uuhorse
Date : 2025-12-22 Size : 8kb User : uuhorse
[Data structs] huffman_encode DL : 0: 功能是基于赫夫曼树的数据结构的文本压缩，根据生成的HuffmanTree来产生字符的编码.即从叶子到根逆向求每个字符的Huffman编码。 -Function is based on the Huffman tree data structure of the text compression, according to the generated HuffmanTree to generate the character codes. That is, from leaf to the root reverse order to each character Huffman coding.
Date : 2025-12-22 Size : 2kb User : sun
[Data structs] huffman_encode DL : 0: 功能是基于赫夫曼树的数据结构的文本压缩，根据生成的HuffmanTree来产生字符的编码.即从叶子到根逆向求每个字符的Huffman编码。 -Function is based on the Huffman tree data structure of the text compression, according to the generated HuffmanTree to generate the character codes. That is, from leaf to the root reverse order to each character Huffman coding.
Date : 2025-12-22 Size : 2kb User : sun
[Data structs] huffman DL : 0: 实现哈夫曼树，输入所需的数据，自动生成哈夫曼树，并输出-Achieve Huffman tree, enter the required data, automatically generate Huffman trees, and the output
Date : 2025-12-22 Size : 1kb User : jorya19
[Data structs] Graph DL : 0: 数据结构中图的操作,包括有向图,无向图,加权图,无加权图.还包括生成最小生成树,以及霍夫曼编码.-Data structure in operation, including a directed graph, undirected graph, weighted graph, non-weighted graph. Also generate minimum spanning tree, and Huffman coding.
Date : 2025-12-22 Size : 272kb User : fengwuyu
[Data structs] huffman DL : 0: 数据结构中生成最小二叉树，已通过测试，可直接使用-Generate the smallest binary tree data structure, has been tested, can be used directly
Date : 2025-12-22 Size : 1kb User : cuiyingying
[Data structs] Text3 DL : 0: 要求：设计要求对输入的一串电文字符实现哈夫曼编码，再对哈夫曼编码生成的代码进行译码，输出电文字符．内容：1　哈夫曼树的建立　　　2　哈服满编码的生成　　　3　编码文件的译码-Requirements: design requirements for the realization of the input character string message Huffman encoding, and then generate the code for Huffman decoding, the output message characters. Content: 1 establishment of the Huffman tree 2 Ha served the generation of code 3 decoding the encoded file
Date : 2025-12-22 Size : 1kb User : 朱丽娟
[Data structs] 2 DL : 0: 设计一个哈夫曼编码、译码系统。对一个ASCII编码的文本文件中的字符进行哈夫曼编码，生成编码文件；反过来，可将编码文件译码还原为一个文本文件。（1）从文件中读入任意一篇英文短文（文件为ASCII编码，扩展名为txt）；（2）统计并输出不同字符在文章中出现的频率（空格、换行、标点等也按字符处理）；（3）根据字符频率构造哈夫曼树，并给出每个字符的哈夫曼编码；（4）图形化输出哈夫曼树、哈夫曼编码；（5）将文本文件利用哈夫曼树进行编码，存储成压缩文件（编码文件后缀名.huf）（6）用哈夫曼编码来存储文件，并和输入文本文件大小进行比较，计算文件压缩率；（7）进行译码，将huf文件译码为ASCII编码的txt文件，与原txt文件进行比较。 -The design of a Huffman encoding, decoding system. On a ASCII encoded characters in text files Huffman coding, to generate an encoded document in turn, the encoded file decoding back into a text file.( 1) from the document read any English short essay ( file for the ASCII encoding, TXT extension ) ( 2) statistics and the output of different characters in the article appears in the frequency (spaces, newlines, punctuation but by character processing ) ( 3 ) according to the frequencies of characters Huffman tree structure, and gives each character of the Huffman coding ( 4) graphical output, Huffman tree Huffman coding ( 5) will be a text file using Huffman tree coding, stored as a compressed file ( coding file name suffix . HUF )( 6) the use of Huffman coding to store files, and to input text file size compared to calculate, file compression rate ( 7) decoding, the HUF file decoding for ASCII encoding txt files, and txt files are compared.
Date : 2025-12-22 Size : 2.71mb User : eric
[Data structs] Generate-Huffman DL : 0: 能够快速的生成哈弗曼树和哈弗曼代码，源代码简单易懂-Able to quickly generate the Huffman tree and the Huffman code, source code is easy to understand
Date : 2025-12-22 Size : 1kb User : 郭涛
[Data structs] Huffman100 DL : 0: 使用Huffman编码进行文本加密（压缩）的一个示例程序。输入一段文字，自动建立Huffman树并生成各字符对应编码，并对编码前和编码后分别占用的空间进行计算-A sample program using Huffman code for text encryption (compression). Enter a text, program will automatically create Huffman tree and generate the corresponding character encoding, finally calculate the memories need before and after encoding respectively.
Date : 2025-12-22 Size : 2kb User : wzf
[Data structs] HUFFMAN DL : 0: 哈夫曼树相关程序，利用哈夫曼（最优树）的原理，实现编码译码的实例之一。本程序包括，按给定字母频率生成编码表，编码、译码过程。-Huffman tree associated procedures, the use of Huffman (optimal tree) in principle, to achieve one instance of coding and decoding. The program includes, at a given frequency to generate the letter coding table, encoding, decoding process.
Date : 2025-12-22 Size : 328kb User : cian