多个Huffman编码、解码器的程序，对数据结构的学习者很有用。...

这是一个用txt文本实现数据库功能的小软件,具备新建,查询,修改等数据库基本功能,这对没有数据库的朋友是个不错的选择-This is a text with txt database functions realize a small software, with new, query, modify the basic functions such as database, which does not have the database of friends are a good choice

ACCESS常用窗体查询，例举多种窗体查询的方法-ACCESS commonly used form inquiry, examples of a variety of form queries

PB商场零售管理系统源码，无需解压密码，对需要的兄弟有所帮助-PB retail shopping center management system source code, without extracting passwords needed to help brothers

算法艺术与信息学竞赛.pdf,仅供大家参考。-Algorithm art and informatics competitions. Pdf, for your reference.

专家抽取系统1.0 是用Delphi6.0 开发的一款用于招投标,评审过程中从专家库中抽取专家的软件。可以将抽取结果导入到Excel或Word文档中-experts Extraction System 1.0 is developed using Delphi 6.0 for one of the bidding, The accreditation process from a pool of experts from a software expert. The results can be taken into the Word or Excel document

Kruskal算法寻找最小生成树,C语言实现，有完整的注释！-Kruskal finding minimum spanning tree algorithm, C Language, a complete Notes!

数据库管理的例子-database management examples

VFP 一个简单的例子，关于人员培训，功能简单-VFP a simple example, the training of personnel, functions simple

c_tan:谭浩强编著c语言程序设计一书的c程序源文件-c_tan : Tan c-language compilation of a program design the source files c

一． 问题描述很多涉及图上操作的算法都是以图的遍历为基础的。试写一个程序，演示在连通的无向图上访问全部节点的操作。二． 基本要求以邻接多重链表为存储结构。实现连通无向图的深度和广度优先遍历。以用户指定的节点为起点，分别输出每种遍历下的节点访问序列和相应生成树的边集。-one. Description many issues involving maps of algorithms are to traverse the map-based. A written test procedures, demonstrating the connectivity of undirected graph visit all the nodes on the operation. 2. Adjacent to the basic requirements for storage of multiple linked list structure. Connectivity to the map without the depth and breadth- first traversal. User specified nodes as a starting point, the output of each node traversal visit Spanning Tree sequence and the corresponding set of edges.