搜索资源列表
java哈夫曼
- java版本的哈夫曼编码 可以编码也可以解码-java version of the Huffman codes can also be encoded decoder
Java环境下的哈弗曼树构建
- Java语言实现的哈弗曼树构建
huffman
- 用java和c++实现的huffman编码解码程序，压缩效率高，且无损。-A Huffman code and decode program Using language java and C++ for compression and depressrion of characters.
Huffman
- 用java 实现 huffuman。有兴趣的可以-Using java to achieve huffuman. Interested can look at
jjjavaHuffmana
- java版本的哈夫曼编码 可可以编码也可以解码 -java version of the Huffman coding can be decoded
jHuffman_javaa
- java huffman tree 实现，算法简简单明白，包括注释 ， -java huffman tree implementation, the algorithm simply understand, including comments
HuffmanCode
- 哈夫曼编码，java写的程序，能够让读者很明白编码的过程，迅速掌握其精髓所在-huffman coding
Huffman
- The file Huffman.java is used to encode and decode image and text.
bvild
- 学习JAVA,学习哈夫曼的好东西,才疏学浅,不当之处,,敬请指教-Learn JAVA, Huffman good things, pretty good, wrong, please advise
431485
- 学习JAVA,学习哈夫曼的好东西,才疏学浅,不当之处,,敬请指教-Learn JAVA, Huffman good things, pretty good, wrong, please advise
huffman
- 哈夫曼（Huffman）树又称最优二叉树或最优搜索树，是一种带权路径长度最短的二叉树。在许多应用中，常常赋给树中结点一个有某种意义的实数，称此实数为该结点的权。从树根结点到该结点之间的路径长度与该结点上权的乘积称为结点的带权路径长度(WPL)，树中所有叶子结点的带权路径长度之和称为该树的带权路径长度.(The Huffman (Huffman) tree, also known as the optimal two - fork tree or the optimal search tree,
test
- Java实现哈夫曼编码效果，通过文件形式得到结果。(Java implementation of Huffman coding)