数据结构的第二个实验

Implementing a queue data structure

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

用VFP实现的图书馆数据库管理-using VFP library database management

一个很简单的java web系统的需求分析及数据库设计-A very simple java web systems analysis and database design

对于小型图书销售书店而言此软件具有图书销售管理功能，可大大减轻Boss的工作量及帐目清算工作。也对这方面软件开发者有参考价值。-book sales for small bookstores run the software with book sales management functions. Boss can greatly reduce the workload and accounts for liquidation. Also in this area software developers have reference value.

用VFP编的电脑查询系统,比较简单,适合初学者参考.-with VFP addendum to the computer search system, a relatively simple reference for beginners.

addlist very good please download it

一个用c开发的小型数据库管理系统dbms-development with a small database management system DBMS

按层序方式（自上而下，每层自左而右）遍历二叉树,二叉树以二叉链表作为存储-sequence by means (from top to bottom, each of which left from right) traverse binary tree, the binary tree with two forks Chain storage

简单的演示,N的大小可以改变的,而且这个程序的速度还可以, 比以前我用递归写的那个快多了.如果N改得太大输出会有问题， 因为我用到gotoxy的,这个程序主要是练一个算法-simple demonstration, N size can be changed, but the rate of this procedure can also, than in the past I used to write a recursive that quicker. If N is too big change in exports, gotoxy because I used, the process is mainly a training algorithm