Ex3

数据结构中链式队列和堆栈的循环用法，非常有用(Queue data structure in the chain and the cycle stack usage, very useful)

8_queen问题的一个自创的算法，还不错！(8_queen)

图的邻接表生成，深度遍历及任意两点间的路径(The adjacency table to generate deep traversal path between any two points)

二叉树类的前序，后序，层次遍历，其以链表方式存储(Binary tree class pre-order, post-order, hierarchy traversal, the linked list storage)

用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)

编程实现Prim算法，基于最小堆数据结构，生成最小代价生成树。 （其中随机生成点和边，形成连通图） 根据输入的顶点数的不同，分析时间复杂度。(Implement Prim’s algorithms based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree. Generate weighted undirected complete graph for given size n according to the following approach: 1) Randomly generate n points ( ) on a plane 2) Randomly generate k pairs of points as edges of the graph. 3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge. )

数据结构线性表教学笔记，内容讲基础知识，没基础可以看看(Linear table data structure teaching notes, basic knowledge content says, no base can take a look)

the longest common serials

以一个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程序实现的 数学上 滑雪问题 的代码实现，供大家学习用(Ski problem code for all to learn to use)