graph-theory

又一个c++委托（函数对象）模板类的实现-Another c++ Commissioned (function object) template class realize

C How to Program 第12章课后练习题12，13题，可以计算多位整数，+，-，×，/，%以及求幂运算

本设计完成了要求的所有功能，可由系统建立一张图或者由用户自行建立一张图,并对该图进行关键路径的搜寻.用户界面友好，有用户使用说明,每一步操作都有说明与提示。程序运行通过，有详细的解释说明。-the design completed all the required functions, from the establishment of a system or plan established by the users themselves a map, and this map critical path of the search. User friendly interface, users note, every step of the operation have notes and hints. Running through a detailed explanation.

从库中调用图片(10KB) 从库中调用图片(10KB)-Picture from the library call (10KB) picture from the library call (10KB)

这是有关内存分配的一些讨论 以及 一些算法的实现-This the memory allocation of some discussion and some algorithm to achieve!

系统用srand()函数产生一个以当前时间开始的随机种子。其产生的种子用选择排序、冒泡排序、快速排序将顺序表中的数字排好，设置变量记录每种排序关键字的移动次数和关键字的比较次数。选择排序：利用L.length-1个循环，将随机种子按从小到大的顺序排好。(System with srand () function generates a random seed to start the current time. Which produces seeds with selection sort, bubble sort, quick sort the order of numbers in the table lined up, set the variable record number of comparisons for each mobile number and keyword sort key. Sort: use L.length-1 cycle, the random seed small to large order lined up. )

随机产生一个迷宫。可以找出一条可以通过的路径。也可以找出全部可以通过的路径。-randomly generated a maze. To be able to find a path through. All can find the path through.

数据挖掘（概念与技术）书上的apiori算法实现。apiori剪枝算法使用候选项集产生发现频繁项集。-Data Mining (conceptual and technical) in a book apiori algorithm. apiori pruning algorithm uses candidate item set generated frequent itemsets found.

这是只是一个示例代码 C 为队列。如何创建队列、 输入的队列、 删除队列、 排序和显示

实现一个数据库的连接池，提高数据库的链接效率，同时还有利于平衡物理上的访问量。-Implement a database connection pool to improve the efficiency of the database links, while also help balance the amount of physical access.