搜索资源列表
javaHuffumancode.rar
- 用JAVA实现哈夫曼编码，能进行插入等操作,Huffman Coding with JAVA to achieve, can be inserted, such as operation
Huffmanjava
- 利用JAVA程序，接受输入的字符串，输出对应的哈弗曼编码 -Accepting the String imported from keyboard ,then export the huffman code of a correspondence.
huffmancode
- 信息论与编码理论中赫夫曼编码的JAVA源码，自己写的，不是多好，但是用起来很方便，仅供参考.-Information theory and coding theory, Huffman coding JAVA source code, their own writing, and is not especially good, but it is easy to use for reference purposes only.
Huffman1
- huffman compression in java
Huffman2
- source code huffman compression in java
Huffman3
- source code huffman compression in java
sourcecodeC
- source code huffman in java
kompresiadaptifberhasil
- source code huffman adaptif with java
Huffman_compress_java
- Huffman compress tool in java
Algorithm
- JAVA中常用到的算法总结，包括HUFFMAN等-the algarithom of java,is be usefull for programming.....
hufior_beta
- 哈夫曼压缩器，是用Java来实现的，挺好用的-the implements of huffman for compreess...
Compresor
- Huffman Compressor. Made in java. Very good to learn the algoritms compressions
HuffmanCode
- huffman code by java language yo will insert your text and you will output resulte-huffman code by java language yo will insert your text and you will output resulte
16-9257_Mohamed-Abdel-moneim-Zaghloul_T-18
- bit encoding using java for huffman
viewer-src
- sourse code to view various tree algorithm as well as file compression using huffman codding in java
HuffmanCoding
- Java实现的Huffman编码程序，Eclipse 开发-Java implementation of the Huffman coding process, Eclipse Development
HuffmanCode
- 一个基于JAVA的huffman编码压缩源码。-Huffman code.
algorithm
- 一些经典算法的java实现：包括：二分查找，最优二搜索树，编辑距离，哈夫曼树，最长公共子序列，矩阵连乘问题，最短路径优先-Some classic algorithm java implementation: including: binary search, and optimal two search tree, the edit distance Huffman tree, the longest common subsequence matrix multiplicative Short
Image_De_C1844651272005
- huffman compression, program uses java code
Harvard
- 哈弗曼编码 使用JAVA实现 精确简洁 使用最小的空间实现最全的功能-The Huffman coding using JAVA achieve accurate and simple to use minimal space to achieve the most complete functionality