VC下的ADO编程封装类。可灵活方便的应用于VC下的ADO编程

前台POS系统,VB源码.程序没有调试,-Future POS system, VB source code. Procedure without debugging,

求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q

DELPHI+ACCESS 客户关系管理-DELPHI+ ACCESS Customer Relationship Management

房地产销售管理系统包括销售房屋、楼房信息管理、客户信息管理、员工信息管理、费用管理等功能。我的毕业设计，毕业论文和打包好的毕业程序代码和未打包的程序代码-real estate sales management system including sales of housing, building information management, customer information management, information management staff. cost management, and other functions. I graduated from the design, packaging and good thesis graduate program code and not the packaging code

红黑树数据结构的c实现-RED-BLACK TREE data structure to achieve the c

delphi中使用ADO的源代码-use of the source code for ADO

用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.

一款特色的韩国的图片滚动方式， -Features a picture of South Korea a rolling basis,

实现自己的数据库管理程序。 可以在输入端里写入SQL语句， 那么我的程序就可以帮你把刚才的语句实现， 然后反应在我的数据库中， 我的数据库的话， 都是我自己管理存储方式， 表属性存储， 等等。要表扬的是我自己利用了缓冲区技术， 当然比正规的MySQL， SQL Server程序差得很多， 但是我自己模仿的它们的内部结构。 用VC++。 谢谢， 大家的欣赏。  

饭店住房管理服务系统(C#.NET)-hotel housing management system (C#.NET)