资源列表
Priority_queue
- 非常好的优先队列学习资料，喜欢acm的同学千万不要错过-Priority queue very good learning materials, like the students do not miss acm
蚁群算法
- 但由于基本蚁群算法(Basic ant colony algorithm)收敛速度慢、易陷入局部最优,所以很多改进的蚁群算法被提出,补偿本身的缺点,在实际应用中也得到了很好的效果(However, due to the slow convergence speed of Basic ant colony algorithm and easy to fall into local optimum, many improved ant colony algorithm is proposed to
GraphAlgorithms
- There are many algorithms that can be applied to graphs. Many of these are actually used in the real world, such as Dijkstra’s algorithm to find shortest paths. We will discuss a few here.-有很多算法，可用于图形。其中许多是实际使用在现实世界中， 如迪杰斯特拉算法寻找最短路径。将在这里讨论几个算法。
The-circuit-wiring
- 算法分析与设计电路布线问题,通过二维数组模拟一个电路布线最短路径问题-Algorithm analysis and design of the circuit wiring problem, simulating a circuit wiring through a two-dimensional array of the shortest path problem
Joseph_
- 约瑟夫环代码，环境vc6.0，代码简短，容易懂-Joseph ring code, environmental vc6.0, the code short and easy to understand
zuoye
- 迷宫问题与运动会,有丰富的实例与测试数据，是学习数据结构的较好的资料！-Maze with the Games, has a wealth of examples and test data, data structure to learn the information better!
123
- 单链表的操作，生成两个有序的单链表并进行合并-Single list of operations to generate a single chain and two ordered to merge
expression
- 用堆栈实现了多项式的计算，适合数据结构的初学者-Polynomial with a stack of computing, data structures for beginners
exp6
- 合肥工业大学数据结构试验六图结构试验 包括完整的实验要求、实验预习报告、实验最终报告 实验要求： <1>求给定图中的边（或弧）的数目。 <2>求解出从给定顶点到所有顶点的最短路径（以边数计算）。 <3>判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根） <4>对给定的图G及出发点v0，设计算法从V0出发深度遍历图G，并构造出相应的生成树。 -Hefei University of testing six graph
LinkedStackInheri
- Linked Stack Inheri链栈（继承链表）例程 运行环境 vc6.0-Linked Stack Inheri
Linux
- Linux下的显示，中断，计时器，信号量，做成的迷宫游戏-Linux
Student_info
- 用二叉树实现学生信息的处理，包括保存删除修改等操作-With a binary tree to achieve student information processing, including operations such as saving delete modify