Location:
Search - huaffmantree
Search list
Description: 文件包含HuaffmanTree.cpp，与头文件HuaffmanTree.h和MinHeap.h 编译后可生成哈弗曼树,是学习数据结构的很重要的基础-the file includes HuaffmanTree.cpp and HuaffmanTree.h and MinHeap.h
Platform: |
Size: 2048 |
Author: 吉铭 |
Hits:
Description: 以二叉链表作为存储结构,探讨各种非递归的遍历算法以及求根结点到任意节点的路径.-In order to list as a binary storage structure, to explore non-recursive traversal algorithm, as well as seeking root node to any node in the path.
Platform: |
Size: 102400 |
Author: cy |
Hits:
Description: 数据结构 哈夫曼编/译码器
功能：
1.初始化：输入一串字符（正文），计算不同字符 (包括空格)的数目以及每种字符出现的频率(以该种字符出现的次数作为其出现频率），根据权值建立哈夫曼树，输出每一种字符的哈夫曼编码。
2.编码：利用求出的哈夫曼编码，对该正文（字符串）进行编码，并输出。
3.译码：对于得到的一串编码，利用已求得的哈夫曼编码进行译码，将译出的正文输出。
输出哈夫曼树形态：以树的形式输出哈夫曼树。-Data structure Huffman encoding/decoding
Function:
1. Initialization: input a string of characters (the body), calculate the number of distinct characters, including Spaces) as well as the frequency of each character (in the number of occurrences of this kind of character as its frequency), according to the weight to build the Huffman tree, output each kind of Huffman encoding of the characters.
2. Coding: the calculated Huffman encoding, to encode the text (string), and output.
3. Decoding: to get a bunch of code, using Huffman coding has been obtained to decode, to translate the text output.
Output: Huffman tree form output in the form of tree Huffman tree.
Platform: |
Size: 720896 |
Author: 屈兴 |
Hits:
Description: 分离的哈夫曼压缩和解压功能，通过建哈夫曼树实现文件压缩和解压功能(The split Hoffman compression and decompression function, by building Hoffman tree to implement the file compression and decompression function)
Platform: |
Size: 391168 |
Author: plasticine
|
Hits: