二叉树实例

ACCESS数据库的压缩,备份,还原,下载,删除的实现-no

determinnant coding in spaning tr-determinnant coding in spaning tree

图的遍历，在连通的无向图上访问全部节点的操作-Graph traversal, in the undirected graph connectivity to access all the nodes to operate

基于有限高斯混合模型的EM算法的源程序代码，里面有实验报告和运行结果。 -based on finite Gaussian mixture model of the EM algorithm source code, which has run reports and experimental results.

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

一个数据库连接池的完整代码，根据网上找来的代码改写。在jbuilder下测试完全通过 使用时注意修改properties文件。用于商业用途请与原开发者联系。原则上只用于学习目的-a database connection pool integrity code, according to the Internet brought the code rewritten. In JBuilder fully tested through the use of properties when changes to documents. For commercial purposes, please contact the original developers. In principle, only for the purpose of learning

c#数据库连接及热图渲染矩阵计算，利用oracle数库连接读入数据，插入数据，利用线性差值及argis二次开发 插入热点，并将结果插入结果矩阵中

SQLite的包装库的源代码，4.7版本可与最新的PBWIN编译器中使用

数据结构的课后练习-Data structure of the after-school practice

树的数据结构源代码-tree data structure source code