A very useful NET s SQL progam.

数据结构的稀疏距阵的实现-data sparse matrix structure of the realization

自用的一个简单的数据库连接池，支持DB2与Oracle，附加了一些常用的功能-Own use a simple database connection pooling, support for DB2 and Oracle, attached a number of commonly used functions

关于最佳贪婪算法的实现 关于最佳贪婪算法的实现-Greedy algorithm on the realization of the best on the best greedy algorithm

汇编语言好的程序，大家来看看 图书选购,(可按分类方式查找图书，或通过关键字进行查询) 购物车功能. 查看图书详细情况。用户注册. 用户登录. 查看用户的订单信息. 修改用户个人信息。后台管理部份：商店图书管理：添加，修改，删除，查看。用户信息管理：查看，修改，删除。订单信息管理：查看订单清单，更新订单付款，出货状态。删除订单。 -good assembly language procedures, to look at the books you buy, (classification according to find books, or through keyword inquiries) Cart function. View details of the books. Registered users. User login. View customer orders information. Revised personal information. Some management background : stores library management : add, modify, delete, check. Users Information Management : View, modify, delete. Orders for information management : View a list of orders, updating of payment orders, shipping status. Delete orders.

数据隐私保护K-匿名问题的动态多次发布类似m-invarience算法-Data Privacy Protection K-anonymity problem on many occasions issued a similar dynamic m-invarience algorithm

求图的任两结点间的距离，(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

迷宫算法！通过递归算法实现！找到最优路径，完成迷宫出口的查找！-maze algorithm! Through recursive algorithm! To find the optimal path to complete the maze exports to search!

希望对大家的学习能有所帮助-member of the study can be helpful

C数据结构常用算法程序集５，描述数据结构算法。-C data structures commonly used algorithm suite 5, describe data structure algorithms.

界面美观,模块功能清晰,连接数据库,适合初学者-Beautiful interface, the module features a clear, connected databases, suitable for beginners