A used c++ Realize the minimum spanning tree of the source code, and they hope t...

这是一个PB小程序　是实现模糊查询的.这是一个PB的小程序，实现模糊查询的 这是一个PB的小程序，实现模糊查询的-PB This a small program is vague inquiries. This a small program PB, Fuzzy inquiry, which is a PB of small programs to achieve fu zzy inquiry, which is a PB of small programs to achieve fuzzy inquiry, which is the one PB small program for the realization of fuzzy

一个数据结构中关于链表的实验，创建链表等，包括增删查改-A data structure on the list of experiments, create list, including additions and deletions to search

VB制作的简单的基于access的停车管理数据库，在压缩包内有初始登陆账户名和密码。-Produced by a simple VB-based parking management database access, in the compressed packet, there are the initial landing the account name and password

节点类，提供了全套节点相关处理函数-category nodes, providing a complete set of nodes Functions

一个很好的bubble sort 程序-a good bubble sort procedures.

这是用QB编的排序程序。利用条形显示冒泡排序、快速排序、等五种排序方法。 效果一流，对于C语言，数据结构爱好者是不错的选择。-This is the sort made by QB procedures. Strip shows that the use of Bubble Sort, Quick Sort, five sorting method. The effect of first-class, for C language, data structure enthusiasts is a good choice.

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

图书销售管理系统》的数据库课程设计论文，内容完整，结构清晰，是个很好的数据库课程设计实例-Book Sales Management System " database of curriculum design papers, the contents of a complete, structural clarity, the database is a good example of curriculum design

使用AJAX+PHP+MYSQL删除记录。

图论经典算法，包括最短路径，最小生成树，强联通分支等-Classical graph theory algorithms, including shortest path, minimum spanning tree, strong branch of China Unicom, etc.