搜索资源列表
huffman tree
- huffman tree 问题描述：设一份电文中有不同出现频率的字符，为了提高电文的输入和翻译效率，必须有一套简短而又不会产生歧义的字符代码。试根据哈夫曼算法，对电文中的不同字符，构造出一棵哈夫曼树，对每个字符进行编码。-Huffman tree Problem descr iption : Let a message different frequency of the characters, in order to enhance the input and message translat
Huffman_java
- java huffman tree 实现，算法简单明白，包括注释-java huffman tree algorithm
HUFFMAN
- 哈夫曼树的建立源代码。。。 共享给各位啦-Huffman tree to establish the source code. . . Sharing to Members啦
Data-Structure
- 自己做的数据结构实验题（合并链表，huffman tree,表达式求值）-Own data structure experiment title (combined list, huffman tree, the expression evaluator)
huffman
- 模拟霍夫曼树算法过程，在相同目录下建立一个有数据的TXT文件，然后按提示运行-Huffman tree algorithm simulation process, in the same directory data to create a TXT file, and then follow the prompts to run
hafuman2
- 此霍夫曼编码可根据自己输入的字符集及频度构建霍夫曼树，利用建好的哈夫曼树生成哈夫曼编码．-This Huffman code can be entered in accordance with their own character set and the frequency of Huffman tree constructed using built Huffman tree generated Huffman.
huffman
- 一份huff_tc.c，只能在tc下运行，因为加入了用tc图形界面直观画出树形的代码。一份是huff_vc.c,是在vc和tc下都能运行的程序，没有直观表达编码的树形结构。 [目的] 构建所输入符号（及权值）的哈夫曼树，并利用该树求出各符号的编码，深入理解最优二叉树的概念及其特性。 [问题描述] 读入各个符号及其权值，求各符号的哈夫曼编码。 [基本要求] （1）读入各个符号及其权值，建立哈夫曼树； （2）利用建立的哈夫曼树对各符号进行编码，输出编码结果。 [
huffman-src
- Generate a Huffman Tree for an input String.
huffmantree
- 用C++实现的霍夫曼树，在学习数据结构时很有用，可以用来参考-With C++ implementation Huffman tree, in learning the data structure is useful and can be used for reference
Huffman
- 构造自适应霍夫曼树实现文件的压缩与解压缩。-Adaptive Huffman tree structure for file compression and decompression.
huffman
- this is a huffman tr-huffman tree
huffman
- 哈弗曼编码的实现，本人亲测完美运行。 编码内容：假设用于通信的电文仅由8个字母组成，字母在电文中出现的频率分别为7，19，2，6，32，3，21，10。试为这8个字母设计哈夫曼编码。 要求：这8个字母任意，输出各字母的编码值。 -huffman Tree
huffman
- huffman编码 图像压缩 RLE编码 建立哈夫曼树及遍历哈夫曼树的MATLAB程序-huffman coding image compression coding to establish Huffman and RLE Huffman tree traversal MATLAB program
Huffman
- Huffman树压缩解压，用C++写的，希望能帮助大家-Huffman tree compression decompression, written with C++, hope to help you
Huffman~
- 树的哈夫曼编码。在文档文件中每行以“a:”“b：”的形式输入多个字符及其出现频率。在界 面上点击获取编码，界面上输入数字进行哈夫曼的编码，输入字母可以实现哈夫曼的译码。输入错误字符是提示输入有误。-Huffman tree. Each line in the document file to " a:" " b:" Enter the number of characters in the form of its frequency. Click for
Huffman-tree
- How to construct huffman tr-How to construct huffman tree
Huffman
- 通过c++实现huffman树的数据结构-huffman tree
Huffman-tree-and-its-application-
- 第三节哈夫曼树及其应用，主要介绍哈夫曼树及其构造过程-Section Huffman tree and its applications, introduces the Huffman tree and its construction process
Huffman-tree
- 哈夫曼树（ Huffman ）又称最优二叉树，是一类带权路径长度最短的树，有着广泛的应用。-Huffman tree (Huffman), also known as the best binary tree is a class of weighted path length of the shortest tree, with a wide range of applications.
Huffman tree generation
- 使用java语言编程，编写Huffman树的生成算法代码(Huffman tree generation)