搜索资源列表
构建哈夫曼树
- 利用C语言构建哈夫曼树 能够模拟哈夫曼树的构建过程，对理解有帮助-C language Construction Huffman tree to simulate the Huffman tree building process, help to understand
Java环境下的哈弗曼树构建
- Java语言实现的哈弗曼树构建
HuffmanTress
- 自动构建霍夫曼树，可以根据输入自动构建霍夫曼树并生成相应的霍夫曼编码，本源码执行速度快。-Automatic Construction of Huffman tree can be automatically constructed based on the input and generate a corresponding Huffman tree, Huffman coding, the source execution speed.
Huffman
- 用基于有堆排序的优先队列构建Huffman树，进行Huffman编码，实现文件压缩、解压缩。-Used to build the Huffman tree based on the priority queue have heapsort, Huffman encoding, file compression, decompression.
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
- 用vs2013写的霍夫曼编码程序，可将.txt中的英文字符串（包括各种字符如：逗号）编码后输出到一个.txt中，并且可输出构建的霍夫曼树,保存编码方式。-Huffman coding using vs2013 to write programs in English can be txt string (including a variety of characters such as: the comma). Encoded output to a txt, and can output to
haffuman
- 基于哈夫曼的压缩和解压缩，将文本中的字符作为节点构建哈夫曼树，通过01来编码，实现对文件的压缩，同时通过逆过程将文件解压缩。-Based Huffman compression and decompression, the text of the character as a node Huffman tree constructed by 01 to coding, to achieve the file compression, through the reverse process to
201516010106项兆坤
- 输入原始文本的种类数量n，输入原始文本的每个字符，输入原始文本的每个权值，构建出一个哈弗曼树，并对每个字符进行编码.输入一串只有原始文本构成的字符串，输出对这个文本的编码(N number of input of the original text, each character input of the original text, the original text of the weights of each input, construct a Huffman tree, and enc
Huffman树
- 数据结构中的huffman树，构建一个Huffman树，并实现huffman编码和译码。(building a huffman tree)