一个的消防队管理系统的例子.己用在了实际的消防业务管理中....

本书主要介绍Delphi的数据库编程知识，为Delphi开发人员提供了很好的指导。-This book introduces the Delphi programming knowledge database for Delphi developers have provided a good guide.

VB6+ACCESS2000 包括源码和安装文件，-VB6 ACCESS2000 including source codes and installation files,

Visual Basic编程实例与技巧（数据库 编程）,本书着重讲述了数据库编程-Visual Basic programming examples and techniques (database programming), this book focuses on the Database Programming

自动从数据库按类导出文本，读取ACCESS，根据文本类别 读出文本-Automatically derived from the database by category text, read ACCESS, according to the text read out the text of the categories

这个课程项目完成了给定DAG graph，找到所有拓扑排序并且输出。用到了指针和链表。对于学习C/C++和数据结构比较有帮助。-this course project has output all the topological sorting given the nodes and relation for the DAG graph. This is very helpful for practicing pointer/link list in C/C++ and data structure

数据库界面自动生成的控件- The database contact surface automatic production controls

动态规划之合唱队形,即利用动态规划解决合唱队形的问题-Dynamic Programming

二叉树遍历的递归算法,帮助理解程序设计过程中的递归思想,以及二叉树遍历的基本思想-Recursive binary tree traversal algorithm, to help understand the program design in the process of recursive thinking, as well as the basic idea of binary tree traversal

最小生成树问题 若要在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.

本代码实现读取数据库记录集的字段名。-the implementation of the code reader database records collected from the field.