use TreeCtr controls access to the database

里面介绍的是严蔚敏《数据结构(c语言版)习题集》第二章答案-introduced inside the Yan Wei Min "data structure (c language version) Exercise Book," the second chapter answer

数据结构中的求强连通分量的源程序，用vc6.0来编写-data structure for the strongly connected component of the source used to prepare vc6.0

在网上下载的示例，用VB的空间MSchart来显示实时曲线，觉得还不错，跟大家分享下，忘记来源哪个网站了，大家可以参考参考。最近一直在用MSchart，下了很多资料，这个是比较不错啊，很有借鉴意义。

degree constraint minimum sppaning tr-degree constraint minimum sppaning tree

问题描述： 假设一个商店，它有一个货架和一个仓库，当货架上的商品数量少于一定的数目时，从仓库运一定数量的商品摆到货架上，当仓库里的商品的数量少于一定的数目时，购买商品把仓库填满，商品的出售要按照商品的生产日期来，快要过期的商品要先出售。 解决问题的方法： 用了两个栈和 一个队列，把队列当作仓库，用一个栈作为货架，把另一个栈当作临时的存储箱。当要往货架上添商品时，先把作为货架的栈中的元素全都压到作为存储箱的栈中，再把仓库中的元素压到存储箱中，然后再把存储箱中的所有元素都压到货架上，这样，就能保证快要过期的商品先被出售。-Problem description : Suppose a shop, which has a shelf and a warehouse, when the merchandise on the shelves less than a certain quantity of the number, a certain number from the warehouses of goods on the shelves, when the warehouse volume of goods is less than certain number, purchase goods warehouse filled, the goods according to the sale of commodity production to date, is about to expire first sale of goods. The solution : a two stack and a queue, queue as a warehouse, used as a stack shelves, and another stack as a temporary storage bins. When to go to the shelves Tim commodity, first as a stack shelves of all elements of the pressure storage tank as the stack, then the warehouse down to the storage element box, and then s

最短路径的具体实现，使用了dikstra算法-Concrete realization of the shortest path, using the algorithm dikstra

节点类，提供了全套节点相关处理函数-category nodes, providing a complete set of nodes Functions

这是数据结构中约瑟夫环问题！-This is the data structure Josephus problem!

算法，钱币组合。可设定钱币种类数量，找出组合种数。-Algorithm, coin combinations. Can set the number of coin types, identify the combination of species.