搜索资源列表
hafuman
- 数据结构中哈夫曼树的程序，用于查找数据非常方便-Huffman tree data structure in the program, very easy to use to find data
hafuman
- 关于哈弗曼树编码的源代码，在c++环境下运行-About the source code tree coding Hafu Man in c++ environment to run
hafuman
- 这是个利用哈夫曼树进行压缩的小程序，能支持各种格式的压缩，非常适合初学者，了解使用哈夫曼树，但效率比较低，需要优化-This is compressed using Huffman tree for a small program that can support a variety of compression formats, is ideal for beginners to understand the use of Huffm
hafuman
- 哈夫曼树的c++代码实现，完成哈夫曼树的构造，可以完成哈夫曼编码-Huffman tree
hafuman
- 哈弗曼编码的实现，非常简短易懂的代码，非常适合学习数据结构-Havermann coded C language implementation, compiled their own, very practical, very easy to understand, want to help everyone understand the Havermann coding
aaa
- hafuman树实现完整版-it is perfect
hafuman
- 字符串的转码和编码转换字符串，先序遍历哈弗曼树-String string transcoding and encoding conversion, first traversal tree
hafuman
- 文件testS中读取字符串，经过哈弗曼编码后，显示每个字符出现的次数以及编码后的0、1串-The file testS reading the string, after Hafu Man coding, showing the number of occurrences of each character, as well as 0,1 string encoded
hafuman
- 本代码是严蔚敏版数据结构课本上哈夫曼树的实现，希望能对在校学生有用-This code is a Huffman tree Yan Wei-min data structures textbooks, and the hope of students in useful
CPP-hafuman
- 采用C++实现了数据结构中常见的哈弗曼方法的编码。-C++ achieve a common data structure Hafu Man method of encoding.
hafuman
- 这是一个哈夫曼树，适应于课程设计，菜鸟学习-This is a Huffman tree, adapted to the course design, the rookie learning
hafuman
- 这是一个哈夫曼树，适用于数据结构课程设计-This is a Huffman tree, applied to the data structure of curriculum design
hafuman
- 哈夫曼编码，用于数据结构当中，课程设计也可以-Huffman coding for the data structure, curriculum design can also be
hafuman
- 关于数据结构c语言版的，哈夫曼树以及哈夫曼编码的源代码-The source code on the data structure c language version of the Huffman tree, and Huffman coding
hafuman
- 利用二叉樹實現哈夫曼編碼器和解碼器的功能-Huffman encoder and decoder functions with Binary Tree
hafuman
- 实现一个 huffman 编码系统，能够对传输报文进行编码，并且译码。-Achieve a huffman coding system, capable of transmission packets for encoding and decoding.
hafuman
- 哈夫曼编码和译码系统 基本要求：(1) 能输入字符集和各字符频度建立哈夫曼树； (2) 产生各字符的哈夫曼编码，并进行解码。 提高要求：(1) 能设计出简捷易操作的窗口界面； (2) 编码和译码存储在文件中-Huffman coding and decoding system basic requirements: (1) Enter the character set and character frequently
hafuman
- 【问题描述】已知输入一串正整数，正整数之间用空格键分开，请建立一个哈夫曼树，以输入的数字为叶节点，求这棵哈夫曼树的带权路径长度。 【输入形式】首先输入正整数的个数，然后接下来为接下来的正整数，正整数个数不超过10个 【输出形式】输出相应的权值 【样例输入】5 4 5 6 7 8 【样例输出】69 -The length of the descr iption of the problem is known to en
hafuman
- 链式表的建立与实现，对广大学习者是很有帮助的，希望能帮助到一些人-Huffman tree establishment and implementation, hope that the majority of learners help, hope to help some people
hafuman
- 此文件是关于哈夫曼树的创建，译码编码，哈夫曼树的显示是用后序遍历输出的。-This file is create Huffman tree, decoding coded Huffman tree display after preorder output.