dbcmp-数据库内容比较工具

数据结构c语言的演示教学-data structure c language teaching demonstration

排课表，对于给定的课程及其先序关系，给出所需学期数最少的排法。-Course Scheduling table, for a given sequence of courses and their relationship first, given at least the required number of semester scheduling method.

这是一个旅行商问题的算法源程序，代码较为简短，说明详细，可读性好。压缩包里面只包含源程序文件，要在vc上面运行。-This is a traveling salesman problem algorithm source code, code brief that detailed and readable. Compressed they contain only source files to run above the vc.

数据结构学习中很重要的一章顺序栈，代码简单易懂-Data structure to learn a very important chapter of the order of the stack, easy-to-read code

南开大学  金属融化问题  辛运帏老师  C++实现  含测试样例

数据结构（清华版），数据结构课后小作业，选择其中较之重点而写 -Data structure (Tsinghua version), data structure after a small operation, select one of the focus than the written

同一个数据库开发的系统，有源代码和发布版本-with a database development systems, and active code releases

顺序栈的基本操作，一共9个，与吴伟民数据结构课本完全一致，用C实现-order stack the basic operation, a total of nine, and Xiulan WU Weimin textbooks data structure is fully consistent with achieving C

用VB+access数据库设计的学生公寓管理信息系统.有一定实用参考价值!-VB access database design student apartment management information systems. Have practical value!

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.