A simple VC++ programming and database link, you can choose the data source

大学的每个专业都要编制教学计划。假设任何专业都有固定的学习年限，每学年含两学期，每学期的时间长度和学分上限都相等。每个专业开设的课程都是确定的，而且课程的开设时间的安排必须满足先修关系。每个课程的先修关系都是确定的，可以有任意多门，也可以没有。每一门课程恰好一个学期。试在这样的情况下设置一个教学计划编制程序。三、基本要求：（1）：输入参数：学期总数，一学期的学分上限，每门课的课程号，学分，直接先修关系的课程号。（2）：课程号尽可能的集中在前几个学期中。（3）：若无解，则报告错误信息；否则见教学计划输入到指定的文件中。计划的表格格式自行设计-University of each professional should prepare teaching plans. The assumption that any professional have fixed the length of each school year with two semesters each semester and the length of time equal to the credit limit are. Every professional courses are opened to determine, and the creation of curriculum time arrangements must meet pre relations. Each course is the pre-established relationship, can have any more doors, there will be no. Each course just one semester. Tests in the circumstances set up a teaching program procedures. Three basic requirements : (1) : input parameters : total semester, a semester"s credit ceiling for each class courses, credits, direct relationship prevocational courses,. (2) : N

校园e卡通中数据库的设计和系统页面设计，实现服务器端数据库对交易的监视和记录的功能 -Campus e cartoon in database design and system page design, server-side database to realize the transaction monitor and record the functions of

本程序用于数据的折半查找,是折半查找的基本算法-the procedures for the binary search data is the basic binary search algorithm

KRUSKAL算法-KRUSKAL Algorithm

VB6.0下DataGrid控件的使用示例！-VB6.0 under the DataGrid control the use of examples!

最接近点对问题，分治法实现，随机生成N个数寻找最短路径的两个点-closest point of the problem, realizing the partition method, random number generation N to find the shortest path to the two points

串的Replace函数-Series Replace function

利用C#语言操作dbf数据库，改程序采用VFPODBC类库，利用类库提供的接口对dbf数据库进行读写删改等操作。比较少见哦，当前的数据库操作主要针对sql server、oracle等主流数据库，对dbf数据库非常少见，但是在shapefile等文件操作时非常有用。

本程序能读取系统环境变量,查看有无鼠标 .若有,便输出Mouse is OK, 反之便输出No mouse.

1，图的建立与遍历操作 建立图的邻接矩阵 输出图从顶点V0出发按深度优先遍历的顶点序列 输出图从顶点V0出发按广度优先遍历的顶点序列 2，图的建立与拓扑排序-1, Graph traversal operation with the establishment of the establishment of the adjacency matrix output plans starting from the vertex V0 by depth-first traversal sequence of vertices losers Figure out from the starting point V0 according to the breadth- first traversal sequence vertex 2, and plans to establish the topological sorting