资源列表
Binary-Sort-Tree
- 建立二叉链表，然后判断是否为二叉排序树。-Build binary list, and then determine whether the binary sort tree.
project3
- 模拟银行叫号系统，输出每个顾客等待的时间，隔定义的5min刷新一次，输出为txt格式-Simulated bank calling system, the output of each customer waiting time, 5min refresh interval defined, the output txt format
ECNA99-real
- 这是East Central North America 1999的比赛题目 及题解，内含测试数据-This is the East Central North America 1999 tournament title and the title of the solution containing the test data
BINARY
- 将整形数据快速转化为二进制数据的小算法。-The shaping algorithm the data quickly into small binary data.
Graph
- 用邻接表存储的图，实现了插入、删除、查找、拓扑排序、关键路径、查找路径等算法。-Adjacency table stored map to achieve the insert, delete, search, topological sort, critical path, find the path algorithm.
Btree
- 二叉树实现。实现了插入、删除、查找、求深度、各种遍历、判断完全二叉树等算法。-Binary Tree. Implements insert, delete, search, seeking depth, variety traversal algorithms to determine a complete binary tree.
Tree-and-Forest
- 树的左孩子右兄弟实现。还有森林的实现。实现了查找、删除、遍历、求深度和高度等算法。-Left child right sibling tree implementation. And forests implementation. Achieve a search, delete, iterate, seeking depth and height algorithms.
Head
- 数据结构常用头文件。包括单链表，双向链表，循环链表，栈，队列。还有几个常用的输入检查函数。-Data structure used header files. Including single-linked lists, doubly linked lists, circular linked lists, stacks, queues. There are several commonly used input checking functions.
prim
- 实现prim算法（利用邻接表，不是邻接矩阵）-Use the adjacent table implementation prim algorithm
Astar
- A*算法求最短路径，数据结构里的图模型。在优化算法方面有很大用途-A* shortest path algorithm，Data structure graph model. Great use in terms of optimization algorithms
Horse-riding-board
- 马踏棋盘算法 用贪心算法求出马能够遍历整个棋盘的一条路线-Horse riding board
Matlab-runcode
- A new method for analysing nonlinear and non-stationary data has been developed. The key part of the method is the `empirical mode decomposition method with which any complicated data set can be decomposed into a nite and often small number of