搜索资源列表
HUFFMAN
- 哈夫曼树相关程序，利用哈夫曼（最优树）的原理，实现编码译码的实例之一。本程序包括，按给定字母频率生成编码表，编码、译码过程。-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
Huffman
- Huffman压缩的全部代码实现，包括Huffman树的构建代码和Huffman编码的实现和获取，以及压缩和解压缩的文件读写，包括界面的实现，完整的实现了Huffman压缩-Huffman compression to achieve all the code, including the building code Huffman tree and Huffman coding implementation and acquisition, as well as compression and
huffman
- 利用哈弗曼树进行压缩和解压,还可以计算压缩比，适用于大学学习数据结构时参考-Huffman tree use compression and decompression, the compression ratio can be calculated with reference to apply to university study data structure
Huffman
- 哈弗曼编/译码器，实现以下功能：初始化，编码，译码，打印代码文件，打印哈夫曼树-Huffman encoder/decoder, the following functions: initialization, encoding, decoding, printing code file, print Huffman tree
tree
- 实现二叉树的先序遍历，中序遍历和后序遍历的递归和非递归算法，以及层次遍历的算法。 用二叉树来表示代数表达式，树的每一节点包括一个运算树，代数表达式中包含“+”，“—”，“*”，“/”和一位整数且没有错误，按照先乘除后加减的原则构造二叉树。 构造一颗哈夫曼树，输出对应的哈夫曼编码和平均查找长度。-Recursive and non-recursive algorithm binary tree preorder, preorder and post-order traversal, and
HUFFMAN
- 这是有关哈夫曼树的建立，基于JAVA数据结构而言的。-build HUffman tree
Huffman
- 哈弗曼编码，输入数据后可计算权重.例如，输入11122233334，可得到权重为1,2,3,4 的权重分别为3,3,3,1-the code of Huffman Tree ，this code can compute the weight of you input data
Hufferman-Tree-Translator
- 霍夫曼树的构建，可以添加元素，自动排出霍夫曼树的结构-Huffman tree is constructed, you can add elements
huffman
- 哈弗曼树的实现，使用最简单的c语言实现，供初学者学习-Huffman tree implementation, use the simplest c language for beginners to learn
Huffman
- 实现哈弗曼编码，可以创建霍夫曼树，然后对数据进行压缩，采用vc6.0-Realization of harvard, coding, can create a Huffman tree, and then the data compression, using vc6.0
huffman
- 给定n个权值作为n的叶子结点，构造一棵二叉树，若带权路径长度达到最小，称这样的二叉树为最优二叉树，也称为哈夫曼树(Huffman tree)。哈夫曼树是带权路径长度最短的树，权值较大的结点离根较近。-Structure and Huffman tree coding and decoding
HUFFMAN
- 哈夫曼树，实现树的创建，编码，编码输出，译码，还有字符串和字符数组相互转换-Huffman tree, to achieve the creation of a tree coding, coding, decoding, and mutual conversion and a string array
Huffman
- 构造哈夫曼树的c++实现代码，非常基础易懂，适合初学者学习。-Huffman tree structure to achieve the c++ code, very basic and easy to understand, suitable for beginners to learn.
huffman
- 霍夫曼编解码，采用构造霍夫曼树进行编码；构造好霍夫曼树后解码的过程就比较简单了；只需通过霍夫曼树找到相应的叶子节点即可解码-Hoffman codec used to encode structural Huffman tree good Huffman tree structure after decoding process is relatively simple just find the leaf node can be decoded by the Huffman tree
huffman
- c语言数据结构 ，利用哈夫曼树存储结构 ， 实现了通讯录。针对大连海事大学数据结构上机实验-the data sturcture which called huffman-tree,we use it to creat a software whose funcation is like address book .
Huffman
- Huffman树的实现，输入字符及对应的权值，自动的生成Huffman树，并打印出来，还可以将Huffman树保存为文件-Realize Huffman tree, input character and the corresponding weights, automatically generates Huffman tree, and print them out, you can also save the Huffman tree for a file
Huffman
- 给出节点及节点上的值，生成huffman树，并输出结果-Give the value of the node, generate the Huffman tree, and output the results.
Binary-tree
- 通过visual studio编译，实现建议哈夫曼树的建立和输出，在图形界面上输出编译完成的哈夫曼树，并输出建立时间-By visual studio compile, implement the recommendations Huffman tree creation and output, the output of the Huffman tree compiled in the graphical interface and output settling time
Huffman
- 1.基本上已经完成压缩及解压缩操作的代码实现。 解压缩时关键还是文件流的操作，读取内容时采用逐字节读取，把0－255的十进制整数转化为二进制数，利用这些二进制数从哈夫曼树的根结点出发，0走左子，1走右子，找到叶子结点，把该叶子结点的下标写入新文件，最后处理有效位数不满8位的字节-1 basically completed the compression and decompression code implementation. Decompression is the key stre
huffman
- huffman 树的c语言实现程序 自己编的 是以前的作业-the translation of huffman tree