搜索资源列表
Huffman_java
- java huffman tree 实现，算法简单明白，包括注释-java huffman tree algorithm
DataCompress
- 实现哈夫曼树，可以动态演示，当输入一个字符型串，就可以生成哈夫曼树-Achieve Huffman tree can be dynamic presentation, when to enter a character string, you can generate Huffman trees
huffman
- huffman树的应用程序 源码以及功能说明-huffman tree-source applications, as well as function
HuffmanTree
- 根据huffman树的一个压缩程序，可以压缩和解压单个文件，压缩率80 左右-Huffman tree in accordance with a compression program, you can compress and decompress a single file, the compression rate of 80
hfmtree
- 哈夫曼树最优搜索算法。欢迎使用haffman编/译码程序，本程序是对报文进行---①编码 ②译码 ③ 打印等 ，让我们开始吧-Optimal Huffman tree search algorithm. Welcome to haffman encode/decode process, the procedure is carried out packet decoding--- ① ② ③ encoding Print, etc. Let' s get started!!
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
- JAVA哈弗曼算法，对初学者有帮组，其实哈弗曼树比较容易懂。-JAVA Havermann algorithm, there are help groups for beginners, in fact, relatively easy to understand Havermann tree.
huffmantree
- 霍夫曼树 用C++编写的。 赠送有其它文档。-Huffman tree written in C++,. There are other documents presented.
HuffmanTree.java
- Java程序：哈夫曼树，文本中有源码，供Java学习者使用-Java program: Huffman tree, the text in source code for Java learners
project2
- 使用huffman tree实现的压缩工具，可以对多级文件夹进行压缩-Achieved using the huffman tree compression tool that can compress the multi-level folder
Test
- 哈夫曼树编码，输出文字出现次数及对应的哈弗曼编码-Huffman tree coding, the output frequency and the corresponding text appears encoding Hafu Man
huffman
- 哈弗曼编译码器，可编译码、查单词出现频率、显示哈夫曼树、显示编码表-Ha Fuman codec can be encoding and decoding, checking the frequency of the word, showing Huffman tree coding table shown
huffman
- 用霍夫曼树进行文件的压缩和解压缩。包括计算字符频率，构建霍夫曼树，进行文件压缩，文件解压缩-Compress file or decompress file with huffman tree. The code include frequency counting, huffman tree building, textzip, decompression.
yasuo
- 利用霍夫曼树实现的压缩txt文件的程序，将压缩结果存到txt文件中-Using Huffman tree txt file compression program, the compressed result is stored in the txt file
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
HUFFMANTREE
- 哈夫曼树是又称最优二叉树，将关键词被搜索的次数看成是哈夫曼树的权值，通过构建哈夫曼树，快速归类，并且通过哈夫曼编码方式无歧义的储存各个关键词。为各个关键字设计哈夫曼编码，使得关键字能无歧义的储存。 内含说明文档-Huffman tree is also known as the optimal binary tree, the number of times the keyword is searched as a Huffman tree weights by constructing t
HUFFMAN
- 这是有关哈夫曼树的建立，基于JAVA数据结构而言的。-build HUffman tree
Hufferman-Tree-Translator
- 霍夫曼树的构建，可以添加元素，自动排出霍夫曼树的结构-Huffman tree is constructed, you can add elements
huffman
- 哈弗曼树的实现。数据结构实验课程安排。本人写的 可以使用过-huffman tree
Huffman tree generation
- 使用java语言编程，编写Huffman树的生成算法代码(Huffman tree generation)