ASP+ACCESS 的东西，请看下。我很想下载点东西。谢谢了。

用VC编写的读取SQL数据库的小程序-VC prepared by the reader SQL database small program

通过输入一串英文（权值）来构建赫夫曼树，并在当前目录下打印赫夫曼图像

算法：华容道问题的启发式搜索。寻求一种最优解的快速算法。-Algorithm: Huarong issues heuristic search.

dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs dhb manager wbs-dhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbsdhb manager wbs

定时器for timer for ic chip-timer for ic chip，timer for ic chip，timer for ic chip

银行家算法！这是一各比较简单的银行家算法，是在c 语言的环境下开发的！-Banker

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

数据结构常用算法C++，快快下载，望 能给大家帮助-data structure used algorithm C, quickly download, we can look to help

给paradox表增加、修改口令。-paradox to the table, change passwords.

仓库管理系统VC源码 在运行程序之前，请将所附的数据库文件dms.mdb添加为数据源，并命名为DMS。-Warehouse Management System in VC-source operating procedures, I would be grateful if the attached document dms.mdb database to add data sources, and was named to the DMS.