实现一个数据库的连接池，提高数据库的链接效率，同时还有利于平衡物理上的访问量。...

 ；/*用于多文本直方图的Visual C#2010代码。

XMathLib是一个通用的3D图形数学库。 其中包含两个部分： XMathLib和XGeomLib。分别处理数学和几何运算。 数学部分包含向量、矩阵、四元数的运算。以及其它的运算。 几何部分包含Box Frustum AABB OBB Ray Line Line-Segment Plan Triangle等的运算。-XMathLib is a generic 3D graphics math. Which consists of two parts : XMathLib and XGeomLib. Separate processing mathematical and geometric computing. The math section includes vector, matrix, quaternion arithmetic. , And other arithmetic. Geometric part consists Box Frustum AABB OBB Ray Line Line-Segme nt Plan Triangle such arithmetic.

程序实现了带表头单链表的最基本操作，包括创建链表，查询数值，插入结点，删除结点，链表分解，将单链表变为循环链表。并附有详细的注释和实验报告。-Procedures to achieve a single-list header with the most basic operation, including the creation of list, query value, insert node, delete node, chain decomposition, into a single cycle of list list. Together with detailed notes and experimental reports.

数据结构的java实现-data structure to achieve the java

企业管理系统,包括工资人事等.基于VB 设计-Enterprise Management System

一个可以直接读写XML文件的delphi程序源码-dirct read&write XML

这是在邻接表的基础上实现的多段图的向前算法-This the adjacency list on the basis of the multi-map algorithm forward ... ... ...

用C语言实现的算法题中的加油问题。 用贪心算法实现的。-C language algorithms that the refueling problem. With the greedy algorithm.

大家好，此源中我们将看到在 DBGrid 中使用的例子：

迷宫算法（maze） /* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination. */ -/* Maze * Starting point is m[0][0], need to find a path go to m[9][9]. 0 means OK, * 1 means cannot go there, boundary is 0 and 9, cannot go beyond boundary. * Each step can be made horizontally or vertically for one more grid (diagonal * jump is not allowed). * Your program should print a series of grid coordinates that start from m[0][0] * and go to m[9][9] * Hint: No need to find the shortest path, only need to find one path that gets * you to desitination.