prim算法的原理利用 prim算法构造最小生成树。有机的应用prim和数组存储生成树。...

成绩查询系统，实现系统的登录、选课、成绩查询等功能。-Inquiry System performance to achieve the system registry, selection, features such as query results.

里面的内容包括：基盘存管理本信息管理库存管理入库管理出库管理等功能-inside contents include :-management of the inventory management of inventory management information storage and management database management, and other functions

数据结构中著名的汉诺塔问题的实现，基于C++实现-Data structure of the famous Tower of Hanoi problem to achieve, based on C++ implementation

一个效率还可以的配对堆 Fibonacci Heap太难写了 配对堆可以有效替代Fibonacci Heap 附带了用它实现的Dijkstra 复杂度O(nlogn+e) -An efficient matching can also be hard to heap Fibonacci Heap wrote a pairing heap Fibonacci Heap can be an effective alternative to use it comes with the realization of Dijkstra complexity O (nlogn+ E)

带通配符的字符串匹配算法源代码-with wildcard string matching algorithm source code

在一台机器上只能处理n个作业，每个作业均可在单位时间内完成，又假定每个作业都有一个截止期限，当且仅当作业i在它的截止期限之前完成时，可以获得一定的效益。 给定作业序列，要求一种作业排序算法，使获得的总效益值最大。 -On a single machine can handle only n-jobs, each job can be completed within the unit, but also assumes that each job has a deadline, if and only if job i in its completed before the deadline, they can to receive some benefits. For a given job sequence, requires a job sorting algorithm, so that the greatest value of total benefits received.

开放程序暗淡用作数据库将声明为私有子 Command_(click) 宣布表集的记录集作为数据库昏暗 r = 如下 （"学生") 设置的 r = d.openrecordset （"选择 * 从 table1")r.AddNew添加新的 r ！Studentname = Text1.Text 从 textbox1 添加到表中字段的 studentname r.Update savingEnd 子关闭程序          

CShap代码 冒泡排序，选择排序，插入排序，希尔排序 算法-Code CShap Bubble Sort, Selection Sort, Insertion Sort, Hill sorting algorithm

是一个ibats和struts的整合的实例，包括多个数据库的代码，（有oracle，MySQL等）-Ibats and struts is a example of the integration, including a number of database code, (with oracle, MySQL, etc.)

北大ACM1003（Hangover）-North ACM1003 (Hangover)