vfp数据库应用编程

数据库开发，实现多数据库交互，复杂查询语句-Database development, the realization of multi-database interaction, complex query

这是一个网络数据库回调例程,基于SocketConnection的-This is a network database callback routines, based on the SocketConnection

在对本程序的快速排序和归并排序这两种算法的正确与否进行验证时，用手动输入的数据，本程序基本上完成了对输入数据进行的快速排序和归并排序!-in the process of the rapid sequencing and merging the two sorting algorithms are correct for the test, with the manual input of data, the procedure is basically completed the data entry for the rapid sequencing and merging order!

PB下的ATM机开发案例。谢谢参考！-PB下的ATM机开发案例。谢谢参考！啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊

01背包问题最简单实现，可在其上做更多的扩展，不知道可否不用递归用堆栈-01 knapsack problem to achieve the most simple, can do more in its expansion, I do not know can not use recursive stack

与postgresql数据库结合的数据库水印软件包-Database watermark software pakage along with postgresql database

伸展树……我写的很难看，而且又很长，这个结构唯一有用的就是可以分离树- Extends the tree... ... I write very ugly, moreover very long, this structure only is useful is may separate the tree

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

凸壳算法，散点成三维体的方法，该方法从洋鬼子那得来的。-convex hull algorithm, scattered dots on the three-dimensional method from the foreign devils that comes from.

应用背景此代码可用于制作与使用Java SQL数据库连接！你只需要替换数据库中的地址信息，用户名和通。关键技术此代码可用于建立数据库连接使用Java和SQL服务器中的应用。它不仅显示了如何连接到数据库，而且还可以如何进行查询和管理数据库连接。