一个快速查询控件，不直接与数据库发生关系，查询速度极快，值得一试...

网络优化算法：任两点间最短路径问题的BellmanFord算法-Network optimization algorithms: the shortest path between any two points BellmanFord algorithm issues

用vb实现读取文本文件（程序里包含三种不同的实现方法），适合于初学者.-Vb read with the realization of a text file (program includes three different method), suitable for beginners.

这个项目是到数据库的简单连接，其中包含插入、删除和修改行的方法，也是一个类连接

顺序栈的基本操作，一共9个，与吴伟民数据结构课本完全一致，用C实现-order stack the basic operation, a total of nine, and Xiulan WU Weimin textbooks data structure is fully consistent with achieving C

能够在数据库中存取大的二进制块-to access large databases of binary block

Java框架物流管理系统，包括客户服务，仓库管理，分拣操作，调度管理，签收操作，条码录入，订单管理，查询操作等

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的两堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分，并分析算法的计算复杂度。-in a circle around the playground are placed n gravel pile. Is a stone should order to be merged into a heap. Stipulated that only elected adjacent to the pile of gravel into the new heap, and a new pile of gravel credited for the combined scores. Design a test algorithm to calculate n heap into a pile of gravel to the minimum score and the biggest score and analysis of algorithm complexity.

Access数据库下实现的系统，功能很强大，适合初学者学习~-Implemented under the Access database system, function is very powerful, suitable for beginners to learn ~

ＰＯＪ　２２７１的己ＡＣ代码．．．不信你可以自己试试．-POJ 2271

一个经典的数据结构的实现-a classic of the data structure to achieve