资源列表
btree
- Trees are natural structures for representing certain kinds of hierarchical data. A (rooted) tree consists of a set of nodes (or vertices) and a set of arcs (or edges). -Trees are natural structures for representing certain kinds of hierarchical data
LSM_Match
- 阅读您的文件最小二乘匹配and高斯解方程子程序-Read your document matching and least-squares Gauss solution equation Subroutine
Optimalbinaryindexassignments
- Optimal Binary Index Assignments for a Class of Equiprobable Scalar and Vector Quantizers-Optimal Binary Index Assignments for a Class ofEquiprobable Scalar and Vector Quantizers
datastructe
- 数据结构的的源码，自行编写的，仅供参考，谢谢提出问题-Data structure of the source, self-prepared, for reference purposes only, Thank you, ask questions
HuffmanCode
- C++实现哈弗曼编码，学习数据结构的时候要用的-C++ Achieve哈弗曼coding, data structures when learning to use the
make_stack
- 关于栈的基本操作：自己做得数据结构试验内容，包括进栈，出栈，添加结点以及删除结点等等，仅供参考。 -Basic operation on the stack: the data structure to do their own tests, including into the stack, the stack, add the node and the deletion of nodes, etc., for reference purposes only.
DataStructureofyanweimin
- 严蔚敏 数据结构的配套代码，在你为书籍晦涩难懂的时候，提供一定帮助-YAN Wei-min data structure matching code, in your books when gimmicks, which provides a help
dfajdkfa
- 队列的应用,利用VC++实现数据结构队列的应用，对大二年级学生学习队列很有帮助。-Queue of applications, the use of VC++ Queue data structure to achieve the application of large second-year cohort study helpful.
OE7
- 本程序给出了SSD5实验课中Optional Exercise7的参考程序 内附有详细的注释 下载后请仔细参照源代码进行分析 切莫完全搬照-This procedure gives the experimental SSD5 lesson Optional Exercise7 reference containing detailed procedures for the Notes Please refer to download the source code for analysis do
ssd5-ex6
- 本程序给出了SSD5实验课中Exercise6的参考程序 内附有详细的注释 下载后请仔细参照源代码进行分析 切莫完全搬照-This procedure gives the experimental classes SSD5 reference procedures Exercise6 containing detailed Notes Please refer to download the source code for analysis do not completely move acco
REX2
- 本程序给出了SSD5实验课中Recommended Exercise2的参考程序 内附有详细的注释 下载后请仔细参照源代码进行分析 切莫完全搬照-This procedure gives the experimental SSD5 lesson Recommended Exercise2 reference containing detailed procedures for the Notes Please refer to download the source code for analy
Huffman
- 本目录下的源代码均属示例、教学性质。作者不对这些代码的功能和性能作任何担保或承诺。 -------- 功能说明 -------- 本目录下的程序用8种不同的方式实现了Huffman编码算法，这8种方式分别是 * huffman_a 使用链表结构生成Huffman树的算法，这是最基本的实现方法，效率最低。 * huffman_b 使用《数据结构》（严蔚敏，吴伟民，1997，C语言版）中给出的算法，将二叉树存放在连续空间里（静态链表），空间的每个结点内