三个求二分图最大匹配的程序（bfs，dfs，多增光路算法）

（１） 用一个４＊２０的二维数组Ｍ，第１行存放按从小到大排序的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.

一个不错的宾馆管理系统-a good hotel management system

数据结构（C＋＋版）的演示程序，详细演示广度优先搜索的具体调用过程,-data structure (C++ version) demonstration program, a detailed demonstration of the breadth- first search specific call process,

这是简单的 XML 序列化库的Delphi。所需的版本的Delphi > = 2010年。此库使用 RTTI。

delphi写的读股票K线源代码-stock was read source code K Line

关于数据结构中的链表的各种应用和操作-With regard to the linked list data structure and operation of a variety of applications, etc.

是对加快程序运行时间，合理程序类型最有效，最有说服力的一本书-Introduction to Algorithm

自底向上排序：思想: 将数组的个部分,两两有序数组进行合并 算法平均时间复杂度: O(nlogn) -Bottom-up sequencing: thinking: The array of parts 22 in an orderly array merge algorithm for the average time complexity: O (nlogn)

基于C语言的各种典型排序算法：插入排序，气泡排序，希尔排序，快速排序，选择排序。可以用VC直接编译运行。-Based on the C language provides a variety of sorting algorithms: insertion sort, bubble sort, Shell sort, quick sort, selection sort. VC can be directly translated to run.

高斯消元法（不列主元）大学计算方法里面的一个算法，用c++编的-Gaussian Elimination Act (PCA not out) University calculation inside an algorithm, using the c series