FastDB

关于管理信息系统的一些很好的案例！ 还有后续呢 很多哦-on management information systems in some very good case! There is a lot of follow-up? Oh

ASP+Accesss数据库设备WEB报修-ASP+ Accesss database equipment repair WEB

二路归并算法的代码,用来排序，文件后缀名是c-a program to sort files under visusl C++ s environment

数据结构c语言各种排序时间复杂度的比较，希尔排序，快速排序等-C language data structure a variety of sorting time complexity comparison, Shell sort, quick sort, etc.

计算机模拟考试3级网络技术笔试-computer mock examinations three network technology quiz

本程序详细 演示了 vc如何连接数据库，对学习mysql与vc++ 有很大帮助-This procedure demonstrated in detail how to connect vc database mysql and studying vc++ has a lot to help

可能是最快的排序算法.源代码和演示文件.-probably is the fastest sorting algorithms. Source code and presentations.

sql数据库电子书-sql database e-books

数据库管理系统，是一个管理学生学籍的-database management system, is a management student behind the expulsion of

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.