资源列表
Huffman
- Huffman树 1.根据要求输入n个权值建立Huffman树 2.完成Huffman树编码并输出对应权值编码 -Huffman tree
SLL
- Single Linked List Data Structure
Kmeans
- 通过k均值算法寻找类中心，聚类，对数据实现有效划分。-The k-means algorithm is used to find the class center, the data is clustered and the data is divided.
ORDER_BTREE
- 实现二叉树的前序、中序、后序排列，以菜单形式出现-achieve binary tree of the former sequence, sequence after sequence arranged in the form of menu
8_puzzle
- 8_puzzle问题，初始状态下8个方块随机排列。编程序排列1～8方块的顺序，使得位于3*3的网格中，并且8个方块处于正确的位置。-8_puzzle problem, the initial state of eight box random order. Programmed with a box-8 in the order, made at the 3 * 3 grid, and eight box at the right place.
link2
- 单向链表的存储表示，适合于刚起步的数据结构学习者。
highpoint
- 高精度模板 C++ 高精度模板 C-High-accuracy high-precision C++ template template C++
cxdd
- 车厢调度源代码，用于解决车厢调度问题，即车厢出栈次序问题-Train scheduling source code, used to train scheduling problem, that is, inside the stack order problem
tu
- 图的应用，有关键路径，dijkstra算法，和floyd算法-Map applications, critical path, dijkstra algorithm, and floyd algorithm
Binary_tree_algorithm
- 二叉树的基本实现算法（创建、遍历递归和非递归算法）-The basic binary tree algorithm (create, recursive and non recursive traversal algorithm)
POJ1113
- 问题：已经平面上的若干点，求包围这些点的最小包围长 度 算法：经典的凸包算法，注意求解时对最外圈做处理。
BinaryTree
- 数据结构综合实验-抽象数据类型二叉树的实现