哈夫曼树的建立,haffman 编码,在turbo c 下运行

数据结构中所有算法的实现，清华大学小严辞C语言版本-data structure of the algorithm to achieve all Qinghua small C-language version of the biblical

《数据结构》算法实现与解析-"data structure" and parsing algorithm

通过修改access数据库的头文件来达到加密数据库的目的，在VC6.0平台上运行良好，已通过测试-Access the database by modifying the header files to achieve the purpose of encrypting the database, in VC6.0 platform to run well, has been tested

清华大学数据结构c++版的代码，很稀罕，很稀有，相当的珍贵-Tsinghua University, the data structure c++ version of the code, very rare, very rare, very valuable

c/s类型通讯和分布式数据库的基本讲解,适于初学者使用-c/s the type of communication and distributed database basic explanations, suitable for beginners to use

有关B-树的删除添加修改操作-the B-tree to add amendments to delete operation

最小化安装BDE环境 详细介绍了如何最小化安装BDE数据库支持环境，并详细说明各个子文件的功用。-BDE installed to minimize the environment described in detail how to minimize the installation of BDE database to support the environment, and a detailed description of the function of various subfolders.

实现ADT,可以实现两个二叉树的几种逻辑关系来显示它们之间的联系.如:求两个二叉树是否是等价的.它们的交集并集是怎样的.等等.这样这些都是ADT要实现的方法.-achieve ADT, can achieve two binary tree several logical relationship to show the linkages between them. Such as : whether the binary tree for two are synonymous. The intersection of what is the set. And so on. ADT then these are the methods to achieve.

BerkeleyDB，非常有名的开源嵌入式数据库系统,含完整安装包、文档和源码-BerkeleyDB, very famous revenue Embedded database system with a complete installation package, documentation and source code

前k条最短路径（KSP）算法在国内鲜有研究，本压缩包中文献整合了自1971年此问题被提出后几十年来的论文共25篇。 其中以Martin先生的删除（Delelte）算法与Yen先生的背离（Devation）算法为主。 其中所有文献均来自网络。含有两篇中文文章以及23篇英文文章。 算法的复杂度基本控制于O(logn)内-Pre-k shortest paths (KSP) algorithm in the domestic few studies in the literature in this compressed package integration since 1971, this issue has been moved for several decades a total of 25 papers. Among them, Mr. Martin removed (Delelte) algorithm and Mr. Yen departure (Devation) algorithm is based. In which all documents are from the network. Contains two Chinese articles and 23 articles in English. The complexity of basic control algorithms in O (logn) in