realize how to use VB to create 2,000 ACCESS database format and database tables...

根据贪心算法，来求解最小生成树； 这种情况，可能求不不全局最优解，但是，可以求出当前情况下的最优解；-According to greedy algorithm to solve the minimum spanning tree this situation, it may not seek the global optimal solution is not, however, you can find the optimal solution under the current situation

简单的职工工资管理系统 通过链表实现的 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报 打分 发表评论 暂无评论

高斯列主元消去法解线代数方程组,高斯算法-out PCA Gaussian Elimination Solution Line algebraic equations, Gaussian algorithms

C语言课程设计--旅店客房管理系统 数据结构：采用十字链表，实现录入、遍历、保存、载入、修改、插入、删除、各种查询及统计等功能。运行环境：Turboc2.0，文本界面-C language:hotel manage system

c语言题型集锦，集合了大量的c语言题型，                                                                                                                拥有很多简单但很实用的算法，对学习c语言来说是不可多得的资料。

一个可以读取Access数据库表的简单实例.可应用于办公室系统中.-can read an Access database tables a simple example. Can be applied to the Office of the system.

输入学期总数 学期的学分上限 课程数 拓扑排序所形成的课程先修关系的边数 课程号及其学分 在各学期学期负担尽量均匀和 课程集中在前几个学期进行排课两种条件下进行排课-importation of the total semester credit semester courses ceiling few topological sorting as a result of the pre-course edge courses, and credits in the semester to semester burden of uniform and courses focused previous semester Course Scheduling for the two conditions under Course Scheduling

自己写的一些小程序 用c实现的数据结构 包括树，图，线形表的基本操作 可以应付老师的-himself wrote some of the procedures used small c achieve the data structure, including trees, maps, linear forms the basic operation can meet the teachers

数据结构学习点滴-bit data structure study

了解设计数据库的基本步骤 熟练使用T-SQL实现建库、建表、加约束 掌握T-SQL编程，实现功能强大的查询 掌握创建索引、视图，快速访问数据库 掌握创建存储过程，实现复杂的业务规则 理解触发器的原理，实现高级的约束,以上摘自幻灯片,这个教程就是关于这一类的-Learn the basic steps of the design of a database of skilled use of T-SQL to achieve the Treasury building, built form, plus bound master T-SQL programming, to achieve a powerful grasp of the query to create the index, view, fast access to the database have to create stored procedures, complex business understanding of the principles of the rules of flip-flop to achieve high-level constraints