搜索资源列表
Java环境下的哈弗曼树构建
- Java语言实现的哈弗曼树构建
Huffman
- 数据压缩的huffman算法使用的是java实现的，可以参考-Huffman algorithm for data compression using java to achieve, can refer to
Huffman_java
- java huffman tree 实现，算法简单明白，包括注释-java huffman tree algorithm
huffman
- 问题描述] 利用哈夫曼编码进行信息通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本。但是，这要求在发送端通过一个编码系统对待传数据预先编码，在接收端将传来的数据进行译码（复原）。对于双工信道（即可以双向传输信息的信道），每端都需要一个完整的编/译码系统。试为这样的信息收发站写一个哈夫曼编/译码系统。-Descr iption of the problem] use Huffman encoding of information and communication can grea
huffman
- JAVA上使用，具有很强大的功能，具有很容易的操作，小巧玲珑-JAVA use, have a very strong function, with very easy operation, small and
Huffman
- Huffman Algorithm: 用于文字压缩，通信等领域，是算法学习的必学章节-Huffman Algorithm： Being used in compressed area
huffman
- java 实现的 huffman 编码 ，可用于图像压缩-huffman encode
Huffman
- 一组指令进行霍夫曼编码，并输出最后的编码结果以及对指令码的长度进行评价。与扩展操作码和等长码进行比较-A set of instructions to carry out Huffman code, and output the final results of the encoding length of the scr ipt evaluation. With the expansion of the operation code and compare the code length
huffman-src
- Generate a Huffman Tree for an input String.
huffman
- 用java和c++实现的huffman编码解码程序，压缩效率高，且无损。-A Huffman code and decode program Using language java and C++ for compression and depressrion of characters.
huffman
- 该压缩包是描述数据结构与算法中的哈弗曼树的Java源程序，可以直接导入Eclipse即可查看效果-The compressed packet is to describe data structures and algorithms in the Java source tree哈弗曼can be directly into Eclipse to see the effect of
huffman
- the application of tree on huffman
Huffman
- huffman code using java
huffman
- JAVA哈弗曼算法，对初学者有帮组，其实哈弗曼树比较容易懂。-JAVA Havermann algorithm, there are help groups for beginners, in fact, relatively easy to understand Havermann tree.
huffmancodeimplementation
- Huffman s compression algorithm implemented in Javascr ipt. 2009-06-02 implemented Huffman s compression algorithm in Javascr ipt. Here is a wiki link describing what Huffman coding is: http://en.wikipedia.org/wiki/Huffman_coding My working e
Huffman_coding_(Java)
- Given an arbitrary set of symbols (the english alphabet is the example that will be used here), Huffman coding is a way of creating the most efficient (smallest) binary code for that set of symbols. It exploits the fact that in most data some symbols
HUFFMAN
- 基于JAVA的HUFFMAN编码和解码仿真-HUFFMAN
HuffmanTree.java
- Java程序：哈夫曼树，文本中有源码，供Java学习者使用-Java program: Huffman tree, the text in source code for Java learners
huffman
- 利用哈夫曼编码进行通信可以大大提高信道利用率，缩短信息传输时间，降低传输成本，试用java语言设计一个哈夫曼编码系统。通过本课程设计，应使学生掌握哈夫曼编码的特点、储存方法和基本原理，培养学生利用java语言正确编写程序及调试程序的能力，运用数据结构知识解决实际问题的能力。-Communicate using Huffman coding can greatly improve the channel utilization, reduce transmission time informati
huffman
- 哈夫曼（Huffman）树又称最优二叉树或最优搜索树，是一种带权路径长度最短的二叉树。在许多应用中，常常赋给树中结点一个有某种意义的实数，称此实数为该结点的权。从树根结点到该结点之间的路径长度与该结点上权的乘积称为结点的带权路径长度(WPL)，树中所有叶子结点的带权路径长度之和称为该树的带权路径长度.(The Huffman (Huffman) tree, also known as the optimal two - fork tree or the optimal search tree,