beipaowenti

使用vc编写的一个动态链接库，测试动态链接库的例程(Vc prepared using a dynamic link library, dynamic link library routine testing)

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

链表L，创建公有成员函数Split（A,B ），创建2个新表A,B，使的A 中含有L中奇数位置元数，B中含L偶数位置元数 (Chain L, create public member function Split (A, B), to create two new tables A, B, A so containing L odd position of a few yuan, B-L even a few locations yuan)

学数据结构自己总结的东西，希望对大家有所帮助。(Learn data structure sum things up, we want to help.)

队列的一般数据结构 队列的创建 删除 修改 取数据等等(The general data structure queue queue to take the data and so create delete modify)

电梯模拟，实现一个模拟电梯的环境，用C程序实现的，封装良好(elevator modify)

最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)

说明：  四路归并排序，将原有的二路归并排序改编的四路归并排序(The four-way merge sort to the original way merge sort adaptation of the four-way merge sort)

中国大学MOOC-陈越、何钦铭-数据结构 解题报告—06-3 六度空间 (Chinese University MOOC- Chen Yue, He Qinming- data structure Solving report of the problem- 06-3 Six degrees space)

这是一个实现找出欧拉路径的的算法，比较完美的解决了欧拉算法(This is an implementation of the algorithm to find Euler path, the more perfect solution to the Euler algorithm)