对学数据结构的朋友很帮助

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

案例一 贪吃蛇游戏 案例二 计算器 案例三 黑白棋游戏 案例四 迷宫问题 案例五 扫地雷游戏 案例六 速算24 案例七 数据结构CAI系统 案例八 进程调度 案例九 存储管理分区分配算法 案例十 通讯录 案例十一 学生成绩管理 案例十二 工资管理 案例十三 图书借阅管理 案例十四 教师工作量计算 -case a huge memory game two cases calculators Case 3 Case 4 game reversi maze problem cases five outbound mine sweeping Case 6 game speed count 24 cases seven CAI system data structure eight cases process scheduling nine cases storage management district allocation algorithm 10 cases of 11 cases of student directories performance management salaries 12 cases 13 cases of books to borrow 14 teachers Case Workload Calculation

清华大学的数据结构讲座，经典书籍，作为复习笔记，都可以

VC++程序实现读写EXCELL数据,可以演示执行代码-VC++ Program Excel to read and write data, you can demo the implementation of the code

矩形编码压缩源代码是针对图象压缩设计的程序，该算法可用于生物信息学，图象处理等方面-rectangular Coding source code is against image compression design process, the algorithm can be used bioinformatics, image processing, etc.

本系统是基于C# Winform应用程序进行开发的。系统实现了用户登录、修改密码、成绩录入和查询，学生学籍信息查询、班级添加和查询、专业信息添加、修改和查询等等基本功能，链接SqlServer数据库，是初学者不可不参考的教程

ＰＯＪ　１００１己ＡＣ源代码，不信你可以试试．-POJ 1001 F AC source code, do not believe you can try.

学生成绩及档案管理信息系统开发 1. 能对与学生成绩有关的各类数据进行输入，修改，与查询。必要时进行打印。 2. 对学生档案有关信息进行管理，输入，与查询。 3. 学期末对成绩进行相关总结并进行排序。 4. 该系统具有各类不同权限，方便用户查询与管理员管理。 5. 具有报错及反馈功能。-student achievement and file management to develop an information system. Can right and the student achievement data for all types of input, modify, and query. When necessary print. 2. The students file relevant information for management, input, and inquiries. 3. End of term related to sum up achievements and sequencing. 4. The system has various powers, user-friendly query and administrator. 5. With errors and feedback function.

求图的任两结点间的距离，(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

swgl业务管理系统