DentalPayment

这个程序是我花了好长时间才做出来的。希望能给大家帮助！！ -This process is I spent a good long time to make out. I hope everyone can help! !

利用深度遍历的方法来检查8数码问题是否有解。-use depth traverse method to check whether the eight digital solutions to the problem.

人事工资管理系统是非常通用的管理信息系统，是企事业单位实现办公自动化的前提和基础。 后台数据库使用SQL Server，前台开发工具使用Visual C++。 本系统采用目前比较流行的ADO数据访问技术，并将每个数据库表的字段和操作封装到类中，从而成功地将面向对象的程序设计思想应用到数据库应用程序设计中。这也是本系统的特色和优势

TRegExpr is easy to use and powerfull tool for sophisticated search and substitutioning and for template-based text checking (especially usefull for user input validation in DBMS and web projects).

PostgreSQL7.4.6 for Linux

车辆管理系统，不错-Vehicle Management System, yes

宾馆管理信息系统-Hotels Management Information System

数据库读写的代码，能够访问ACCESS数据库，自动创建，并具有筛选功能，需要用户名匹配才能修改，撤销修改等功能！

北京矢量电子地图shp格式，可用于GIS二次开发地图，如MapObjects，MapX等二次开发地图。-Beijing vector electronic map shp format, can be used for secondary development of GIS maps, such as MapObjects, MapX maps and other secondary development.

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