资源列表
HuffmanTree
- 霍夫曼编码是一种编码方式，是一种用于无损数据压缩的熵编码（权编码）算法。用变长编码表对源符号（如文件中的一个字母）进行编码，其中变长编码表是通过一种评估来源符号出现机率的方法得到的，出现机率高的字母使用较短的编码，反之出现机率低的则使用较长的编码，这便使编码之后的字符串的平均长度、期望值降低，从而达到无损压缩数据的目的。-Huffman coding is a coding is a lossless data compression entropy coding (right coding)
Maze
- 利用递归法走迷宫，先试探，再回溯，代码简单，有意思-Maze recursive method, first tentatively, then backtracking, the code is simple, interesting
Queue
- 用C++写的队列数据结构，用两种方式实现的，一种是动态数组，另一种是链式队列。-C++ write queue with data structure implemented in two ways, one is a dynamic array, and the other is chain queue.
Qt_LST.tar
- 斯塔纳树算法的图形化表示，利用图形界面显示斯塔纳树的形状，能够通过鼠标事件添加节点/删除节点/移动节点/局部放大等等。开发环境为Qt-Smetana tree algorithm graphical representation, using the graphical interface display Smetana tree shape, can through the mouse events add/delete node/node mobile node/local amplific
AVL tree operations
- Contains programs for AVL tree operations like insertion, deletion, search etc
xhqueue
- 循环队列的实现，实现数据结构里的循环队列-Achieve the cycle queue data structure in the circular queue
LINKQUEUE
- 实现了数据结构中的链式队列的操作，学习数据结构的朋友可以下载-Data structure to achieve the operation of the chain of the queue, a data structure of a friend can be downloaded learning
count-leaf-nodes
- 利用递归算法，前序遍历，统计叶结点数目，并且实现左右子树交换-Recursive algorithm, preorder traversal, statistical point of leaf number, and realize about subtrees exchange
2Dmath
- 2D math algorithm library to manipulate 2D vectors and matrix
stack
- 该源码实现了严蔚敏数据结构中的栈部分算法，主要包括栈的初始化，出栈，入栈，取栈顶等算法。-The source code to achieve the YanWeiMin part stack in data structure algorithms, including the initialization of the stack and the stack, stack, take the algorithm such as the stack.
double-foot-robot-program
- 机器人是一个热衷的话题，也是现在发展的趋势，也是我们这些电子爱好者追求的东西，这是一点点关于双足机器人的研究程序-The robot is a hot topic, is also a trend, also is we these electronic enthusiasts to pursue something, this is a bit of a biped robot research program
disjoinset
- 自己写的并查集数据结构，用于实现不相邻集合的查找与合并-Write your own and check the set data structure used to implement a set of non-adjacent Find and merge