主要是二叉树的一些性质的操作。包括复制，清空，求取树高，树中元素的个数，得到根结点，父亲结点，所有祖先，左儿子，右儿子，插入左儿子，右儿子，查找某个元素，以及前...

仓库管理系统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.

非常多的数据结构算法示例代码，以及关于算法的描述文档。-some classic data Data Structure Algorithm code and description.

个人记事本，写日记、或记录各种密码 学习VB操作Access数据库可参考。-Personal notebook, diary, or record a variety of learning VB password to operate Access database can be found.

是数据结构中的基数排序算法，挺不错的，谢谢大家-Data structure is a sorting algorithm in the base, very good, thank you

前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

最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications networks needed to put up only n-1 lines can be. How the lowest economic cost of building the communications network, the network is a minimum spanning tree problem. (1) using Kelushikaer network algorithm for the minimum spanning tree. (2) to achieve 6.5 textbook definition of the abstract tree types MFSet. Spanning Tree Construction said this process of connectivity components. (3) the form of text output spanning trees and the edge of their weights.

K路归并算法，用贪心算法构造霍夫曼树，采用加入虚节点的思想求出最优的归并模式-K Road, merge algorithm, greedy algorithm using Huffman tree constructed using the idea of adding virtual nodes to derive the optimal merging pattern

示例：为MSHFlexGrid控件的表格设置不同的背景色！-Example: In order to form a different background color to set!

1、为病人提供更好更快、更快的服务，提高医院在医疗市场的竞争力以及吸引更多的病人到本医院就医； 2、人力工资昂贵，迫使医院采用计算机以提高劳动效率； 功能：1、门诊挂号：为病人提供就医卡方便病人； 2、住院病人管理系统：是医院可以随时了解病人情况； 3、药房管理系统：提高了药品管理的质量，和工作效率； 4、门诊医生工作站、住院费用的管理、病历管理系统、以及外部接口等。-1, for providing patients with better and faster and more efficient services and improve the hospital in the medical market competitiveness and to attract more patients to the hospital 2, manpower, high cost of labor, forcing hospitals to improve the working efficiency of the computer function : 1, out-patient registration: In order to provide patients with the convenience of patients for medical treatment card 2, patients management system: a hospital patient can understand 3, pharmacy management system: To improve the quality of drug management, and efficiency 4, the doctor-patient workstations, the cost of hospital management, medical records management system, as well as external interfaces.

客户关系管理系统,可以进行一些简单的客户关系管理