数据结构课本的算法，自己独立编写，配套教材严蔚敏，清华大学出版社。声明：未经本人许可，禁止用于商业和不法用途。本作者对本代码保留所有权利。...

电脑排课(普通不过的)-course timetable by computer(very normal)

二叉树的一些基本实现：具备功能：创建、删除二叉树（包括文件读取录入信息），先中后根显示二叉树（递归算法），结点信息查询（包括：结点所在层数，结点孩子个数，结点在先中后根排序中的位置、寻到结点路径长度），二叉树相似度比较；附带注释，界面友好，代码是在VC6.0下写的。

数据结构第三章中栈和队列的源程序，实现了全部算法-this is a code of data structure

自己开发的b+树代码,经过本人测试,已经初步通过,有问题请联系我-b own development code tree, after I test, it already passed, please contact the problems I

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

具有n 个顶点的无向网络G的每个生成树刚好具有n-1条边，采用三种不同的贪婪策略来选择这n-1条边。-n vertices to the non-G network spanning tree just with each n-1 edge, using three different strategies to choose greed that n-1 edge.

ADO操作SQL数据库编程完整案例-ADO operation SQL Database Programming integrity cases

这是我们实习时编的，实现了基本的功能，如插入，删除，查找等。初学 C++的同志们可以参考：）-This is our attachments series to achieve the basic functions, such as inserting, deleting, and searching. Novice C comrades can reference :)

使用VC编写的二叉树程序，简单明了，方便使用-Written in binary tree using the VC program, simple and clear, easy to use

汽配管理系统 用C语言设计的完整的系统