KRUSKAL Algorithm

一 开发环境 OS: Windows 2000 Server + SP2 IDE: Visual Studio 6.0 + SP5 DataBase: SQL 2000 Server + SP2 在运行程序之前，请将所附的数据库文件dms.mdb添加为数据源，并命名为DMS-A development environment OS: Windows 2000 Server+ SP2 IDE: Visual Studio 6.0+ SP5 DataBase: SQL 2000 Server+ SP2 before running the program, please attached the database file for the data source to add dms.mdb named DMS

初学者的源c代码，一共5个，主要是c基础,包括文件操作。-c beginners source code, a total of five, mainly c base, including file operations.

这是一个分治解决的零件切割问题:给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？加上一个小界面-This is a solution to the partition cutting parts : a given width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the respective cut out n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked how cutting makes use of the rectangular plate height h minimum? A small interface

FastDb是高效的内存数据库系统，具备实时能力及便利的C++接口。FastDB不支持client-server架构因而所有使用FastDB的应用程序必须运行在同一主机上。FastDB针对应用程序通过控制读访问模式作了优化。-FastDb is efficient memory database systems, with real-time capability and convenience of the C interface. FastDB not support client-server structure which all use of the application process FastDB Order must be running in the same host. FastDB against applications by controlling access mode was reading optimization.

昆士兰殷朝：数据结构（使用面向对象方法和C语言）

堆栈的实现代码，实现了栈的所有功能，PUSH，POP，插入，销毁，清空等，有调试程序，可以很清楚的看到栈的运行过程-Realize stack code, realize all the features of the stack, PUSH, POP, insertion, destruction, empty and so on, have a debugger, you can clearly see the operation of the process stack

企业售后管理系统-enterprise management system sale

完成数据结构的最小生成树，程序很实用，不需要修改！-The completion of the minimum spanning tree data structure, the program is very useful, do not need to change!

《数据结构与算法入门导学》 第一章 概论 第二章 线性表 第三章 栈和队列 第四章 串 第五章 多维数组和广义 表 第六章 树 第七章 图 第八章 排序 第九章 查找 第十章 文件-" Introduction to Data Structures and Algorithm Study I." Introduction to Chapter II Chapter III Chapter linear stack and queue Chapter IV Chapter V multi-dimensional array of strings and generalized tree table Chapter VI Chapter VII Chapter VIII of the sort ninth plan Chapter X Chapter document search

一种基于数据访问流的数据库索引优化方法该方法通过集成业务流程模型与数据模型，抽取了流程活动中包含的数据访问操作和流程的控制结构形成数据访问流，分析了数据访问流中数据访问操作的频度，为频繁数据访问操作所对应的数据项创建索引，达到改善数据访问性能的目的。实验结果表明，该方法提高了数据查询的速度。-A novel method called data-access-flow based index optimization (DAFIO) is proposed to provide automatic index select for databasein order to improve the data access performance. By integrating the data model and process model of the IT systems and getting data access flow, theDAFIO method can analyze the data access flow to find those data item which are accessed frequently, and then create indexes for these frequentitems. The experiment results show that the novel method is effective to improve the data access performance.