C#编写的OleDb数据库连接通用类库。

同一个数据库开发的系统，有源代码和发布版本-with a database development systems, and active code releases

VB制作的简单的基于access的停车管理数据库，在压缩包内有初始登陆账户名和密码。-Produced by a simple VB-based parking management database access, in the compressed packet, there are the initial landing the account name and password

软件简介：（贸易管理系统Delphi源代码（有开发文档） 采用access+delphi设计 软件实现功能：供应商信息的输入，修改，查询； 顾客信息的输入，修改，查询； 商品信息的输入，修改，查询； 进货信息的输入，修改，查询； 销售信息的输入，修改，查询。 输入：输入数据记录，并提交，可以保存入数据库； 输入信息包括 供货商： 供应商编号-software description : (Trade Management System Delphi source code (with the development of documentation) using access delphi design software functions : information provider input, modify and inquiries; Customer information input, modify and inquiries; Information on the importation of goods, modify, inquiries; NT information on the importation, modification, inquiries; sales information input, modify inquiries. input : input data records, and submitted it to keep the database; input suppliers including : provider number

快速数据库的编程实现-Rapid Database Programming

数据结构与算法-程序、素材Kruskal构造算法-Data Structures and Algorithms- procedures, materials Kruskal Algorithm

在设计会计软件时,常常要把小写金额转换为大写金额,通过本例,你只要输入小写数字,即可转为大写金额.-accounting software in the design, it is often the amount should lowercase to uppercase conversion rates, through the cases, as long as you input lowercase figures, the amount can be converted to uppercase.

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

数据结构一元多项式的实现-data structure of one yuan achieve polynomial

1．定义串的顺序存储结构。 2．编写函数实现串的初始化、分配、取子串算法 3．编写函数据实现串的模式匹配-1. The definition of the order of string storage structure. 2. The initialization string write function implementation, distribution, taking sub-string algorithm 3. Write a function, according to string pattern matching to achieve

ODBC源代码:odbc_classgen-odbc code :odbc_classgen