算法设计与分析实验报告，内容很全面的，呵呵。

PB9.0生成的图书管理系统，该系统包含读者管理和图书管理两部分，能完成图书借阅的基本功能。后缀为db的是数据库文件-PB9.0 generated library management system, which includes management and library management readers in two parts, to complete the basic functions of books to borrow. Db suffix to the database file

这是用链表实现的栈数据结构。链表数据结构的最大优点是不受元素个数的限制，除非内存耗尽。-This is the stack implementation with linked list data structure. List data structure is not subject to the greatest advantage of the restricted number of elements, unless the memory run out.

猴子选大王，c语言，有源码，有注释，可供使用交流。-election monkey king, c language, the source code, notes, the availability of the exchange.

java与access相连的api,其中包括一个建好的access数据库.-connected api, including the completion of an access database.

一个ADO+VC的源码，适用于初学者,里面还有其他控件用法-A ADO+ VC source for beginners, there are other controls usage

此源码的会员,代理,后台功能齐全,是真真正正包含数据库(在matali文件夹里)的源码-This source member, agent, complete back-office functions is a truly contains the database (in matali folder) of the source

统管理：初始设置，吧及吧类别设置，部分广告管理，用户管理，帖子管理，数据库压缩、备份和恢复； 初始设置：站点基本资料、色彩搭配、相关协议文本、站长资料、信息权限、导航条设置等； 吧务管理：帖子管理； -FOR ASP

开发工具 Informix-4gl- Development kit Informix-4gl

一 开发环境 OS: Windows 2000 Server + SP2 IDE: Visual Studio 6.0 + SP5 DataBase: SQL 2000 Server + SP2 二 运行 1：创建数据库 将TRADE.sql中的SQL语句考入SQL Server的查询分析器中，全部运行； 2：建立ODBC数据源 数据原名称为Trade_MIS-A development environment OS: Windows 2000 Server+ SP2 IDE: Visual Studio 6.0+ SP5 DataBase: SQL 2000 Server+ SP2 Second run 1: create a database of SQL statements TRADE.sql admitted to the SQL Server" s Query Analyzer, all running 2: Create ODBC data source data formerly known as Trade_MIS

1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!)