关于数据库学习的 关于数据库学习的

这是我的功课在我关于树的代码在 c + + 中的校园。如何创建树、 闹市、 dealocation、 查找数据、 将数据插入、 删除数据、 显示等。

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

数据结构用java实现的一些源代码，包含了我们常用的一些数据结构。-java data structure used to achieve some of the source code, including our common data structure.

图的深度优先遍利 图的深度优先搜寻法 有注释-Fig times the depth of Victoria map priority depth-first search method has the Notes

VC_VB_Database_management

该程序在于如何进行图片存取,怎样访问EXCEL表格.-the program is how to access pictures, how to visit Excel.

这是一个生成组合序列的程序,而且是非递归的,代码非常精简,速度很快,序列是字典序的.-This is a combination of sequence generation process, but also non- recursive, code very concise, very fast, is the sequence of lexicographic.

该程序显示 w100 和 COM 端口的计算机之间的通信。每袋式输送机规模过大，它将保存那个袋子的重量。

这是一个旅行商问题的算法源程序，代码较为简短，说明详细，可读性好。压缩包里面只包含源程序文件，要在vc上面运行。-This is a traveling salesman problem algorithm source code, code brief that detailed and readable. Compressed they contain only source files to run above the vc.

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