视频租赁计划。简单的

FP树算法源代码 FP树算法源代码-tree FP algorithm source code tree FP algorithm source code tree algorithm source code

基于有限高斯混合模型的EM算法的源程序代码，里面有实验报告和运行结果。 -based on finite Gaussian mixture model of the EM algorithm source code, which has run reports and experimental results.

一个操作Sql Server 2000数据库的工具,支持远程（局域网）操作 主要功能就是远程（局域网）操作Sql Server数据库 包括： 搜索并列举局域网内的所有Sql Server服务器 搜索并列举Sql Server服务器中的所有数据库 搜索并列举数据库中的所有表 对数据库结构的简单更改 对数据库表记录的查找、编辑等等。

该源代码为数据库设计的报刊订阅，和报告，挺详细的，适合初学者-The source code for the database design of newspapers and periodicals subscriptions, and reports quite detailed, suitable for beginners

最小生成树的贪心算法实现 普里姆算法 用邻接矩阵进行图的生成-the minimum spanning tree algorithm Primbetov greedy algorithm adjacent matrix chart generation

数据库存储管理的实现，根据输入文件建立 B + 树索引和散列索引，并将索引存入外存文件中。实验实现 B + 树索引的建立、查找、插入、删除，以及索引写入外存、重新读入和重构等功能

算法导论(中文版)，讲述了现代计算机常用数据结构和算法-this book intrdduce the basic algorithm,the language is chinese

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time

DAO操作Access数据库类，提供测试程序-Access Database DAO type operation, procedures for testing

同学通讯录系统,利用MFC编写,利用了数据库的技术-classmates directory system, using MFC preparation, the use of database technology