搜索资源列表
Huffman
- 数据结构中最优二叉树Huffman编码的实现,仅供参考
Java_11183501
- 《Java数据结构和算法》(第2版)介绍了计算机编程中使用的数据结构和算法,对于在计算机应用中如何操作和管理数据以取得最优性能提供了深入浅出的讲解。全书共分为15章,分别讲述了基本概念、数组、简单排序、堆和队列、链表、递归、进阶排序、二叉树、红黑树、哈希表及图形等知识。-" Java data structures and algorithms" (2) describes computer programming, data structures and algorithms
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
01beibao
- 0-1背包问题,空间点对问题,图形压缩,线性时间选择以及最优二叉树的java脚本程序-0-1 knapsack problem, the point of the problem space, image compression, linear time optimal tree selection and java scr ipt program
zuiyouerchashu
- 最优二叉树的Java脚本文档,采用的是图搜索策略。-Optimal binary tree of Java scr ipt document, using the map search strategy.
Greedy_Huffman
- 哈夫曼树的Java实现, 哈夫曼树又叫做最优二叉树,是一种带权值路径最短的树,这种树在信息检索等方面都很重要。-Huffman tree Java implementation, optimal binary tree Huffman tree is also called, is a weighted value of the shortest path tree, this tree is very important in information retri and so on.