数据结构中的非波那起序列

student select course system,powerbuilder做的，很容易实现 ,不会有人上载了吧-student select course system, powerbuilder done, it is easy to realize that no one on the right is contained

二叉树有一个优雅的递归指针结构，所以他们是一个很好的学习方法递归指针算法。 - Binary trees have an elegant recursive pointer structure, so they are a good way to learn recursive pointer algorithms.

Caution tagging for live line works

login sript .PHP usefull to connect DB

分支限界tsp算法中求下界函数的值。有中文注释。-Tsp branch and bound algorithm for the lower bound of the value function. Chinese Notes.

（１） 用一个４＊２０的二维数组Ｍ，第１行存放按从小到大排序的20个所给出的ai和bi，第２行存放相应的作业序号，第３行存放１或２(１代表是来自ai，２代表是来自bi), 第4行存放0或１（０代表作业序号未进入最优调度方案；１代表作业序号已进入最优调度方案） （２） 排序完后，按课本所述方法求一种最优调度方案，存放在S中。 -(1) with a 4* 20 two-dimensional array M, the first a line to deposit a small to large order of 20 given by ai and bi, line 2 store operation corresponding serial number, the first three lines deposited one or 2 (a representative from the ai, 2 representatives from the bi), the first four rows stored 0 or 1 (0 for job number to gain access to optimal scheduling programs a job number has been entered on behalf of the optimal scheduling scheme) ( 2) Sort exhausted, according to the methods described in textbooks, seeking the optimal scheduling of a program stored in the S in.

-罗塔，而且移动，可以清楚地看到整个过程

求最短路径的C++ 源代码 ，用很简单的数据结构实现的，运行速度很快-The shortest path for the C++ Source code, using very simple data structure to achieve, to run fast

自动高速Grid的列数,蛮不错的呀!-out in the Grid, quite good!

清华大学的数据结构讲座，经典书籍，作为复习笔记，都可以