this is a code of 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.

动态加载odbc数据源及其内部表单的小程序-Dynamic loading odbc data source and its internal form of small programs

RMQ的st算法，两道题，一个是一维的，一个是二维的-RMQ the st algorithm, two questions, one is one-dimensional, and one is two-dimensional

一个关于供求陪送的线路程序。里面用到了最短路径的知识，给初学者参考-one of the lines of supply and demand escort procedures. They use the shortest path of knowledge, reference to beginners

读入一个文本数据，转换成矩阵。 -Reading into a text data, conversion into a matrix.

这是 apriori 算法的数据挖掘工具。 c# 和.NET 2.0，很容易理解，您可以重写它，使它更有效率。

描述（英文）：（提示：至少100个字符。请尽你所能详细描述你的项目。更好的内容将为您赢得更多的分数）

此为初步实现，简单直观，可在此基础上增强功能。-preliminary achieve this, simple, and the basis of this enhanced functionality.

数据结构试验，包含试验报告和源码，运行能通过，自己写的-Test data structure, including test reports and source code, run through, their own written