tree

包含了数据结构实现堆栈的方法。 主要有链表实现和数组实现以及堆栈的应用。(This pakcet inclues the programs to implement the stack with chain and array and it s application.)

模拟枝晶生长，在统计学常用的一种算法，对随机理论有帮助。(Simulation of dendritic growth, the statistics used an algorithm, the stochastic theory.)

校园导航系统包含佛山科技学院本部校区的校园景点平面图。通过系统的各功能不仅可以查询任意景点的编号，名称，简介等信息，还可以查询任意两景点间的最短路径及长度和所有路径及长度。另外，还可以通过一系列操作增加，更改或删除任意的景点的各信息。(Contains the campus attractions plan of the campus Foshan Institute of Technology campus navigation system. Through the function of the system not only can query any spots number, name, profile and other information, can also query the shortest path and arbitrary length between two spots and all paths and the length of. In addition, can also increase through a series of operations, the information change or delete any of the attractions.)

这个代码是STRING类的声明及实现,因为我认为C++类库中的string类比较庞大,找一个函数需要很长时间,所以用一个简单明了的代替之.(STRING kind of statement and realized, because I think the C library string of relatively large, a function for a very long time. Therefore, the use of a simple and straightforward replaced it.)

数据结构课程设计－－实现并对比三种基本的字符串匹配算法(EasyMatch Rabin—Karp KMP)

以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有 通路的结论 (To an m* n the long square maze, 0 and 1, respectively maze of paths and obstacles. Design a program, for any set of the maze, find a path from the inlet to the outlet, or the conclusions drawn without passage)

说明：  有助于c++的初学者在平日的学习中更好的学习(Contribute to better learning c++ beginners learning on weekdays)

希尔排序，希尔排序，希尔排序，希尔排序，c语言(shell sort)

数据结构c语言版，图的遍历，周游世界，无向图的遍历，包含14个国家。(Data structure c language version, graph traversal, travel around the world, undirected graph traversal, including 14 countries.)

表达式cpp实现 数据结构实验源代码 实现前序、中序、后序表达式(Expression codes Formerorder expressions regular expression&Postorder expressions )