VB的图书馆系统，数据库使用ACCE

离散事件模拟程序，以及自定义数据类型的队列实现-Discrete event simulation program, as well as custom data types of queues to achieve

mfc动态演示，基于贪婪法的拓扑排序。

操作节点，非常好-operating nodes, a very good

利用分裂基算法求实序列 的DFT， 的虚部赋值为零。-Split-radix algorithm for the use of realistic sequence of DFT, the imaginary part of the assignment to zero.

旅行商问题： 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.

这是关于01背包问题的动态规划算法。采用C++语言完成的，代码间有注释。-This is about 01 knapsack problem dynamic programming algorithm. Using C++ language completed, there are comments between the code.

有需要的同仁载回去慢慢研究-need colleagues set back slowly study

施伯乐@黄皮书《数据结构教程》part3-Shi Bole @ beige book Data Structure Course part3

数据结构 Balance-Bi-Tree 数据结构 Balance-Bi-Tr-data structure Balance- Bi-Tree data structure Balance- Bi-Tr ee data structure Balance- Bi-Tree data structure Balance- Bi-Tr

 ；文件O显示：读取数据从文件和cab可以传输您想要的格式。