资源列表
cart2
- classification and regression tree algorithm 算法c++实现-classification and regression tree algorithm vc++
linuxPRprog
- linux下的一个二叉树和四叉树联合数据的实现C++，也可移植到VC下，包括了makefile文件，直接make即可-achieve C++ a linux binary tree and quadtree under the joint data can also be ported to VC, including the makefile file, you can directly make
nunit.framework
- 子图同构算法需要用到的dll文件，将这个文件解压，然后添加引用即可-SubGraph Isomophism
bitVector
- 位向量的计算，位向量的排序算法。没有相同数字的排序，效率非常高。-Bit vector calculations, the bit vector sorting algorithms. Not have the same sort of figures, the efficiency is very high.
JuggleRotate
- 辗转相除法的代码实现。辗转相除法， 又名欧几里德算法（Euclidean algorithm）乃求两个正整数之最大公因子的算法。它是已知最古老的算法， 其可追溯至3000年前-Euclidean algorithm, also known as Euclidean algorithm (Euclidean algorithm) is seeking the greatest common factor of two positive integers algorithm. It is the o
1215
- VISUAL C++数据结构，贝努里树的优先级序列，能查找最小值，插入删除操作。-VISUAL C++ data structure, the priority sequence of Bernoulli tree can find the minimum, insertion and deletion operations.
1203
- VISUAL C++数据结构，线性链表的实现，能有查找功能，插入删除操作。是一个类。-VISUAL C++ data structures, linear linked list implementation, can have search function, insertion and deletion operations. Is a class.
1205
- Descr iption 已知Ackerman函数定义(见课本)。 输入只有两个整数：m n。 要求输出A(m,n)。 Input Format 输入文件包括一行,两个整数，m和n。 Output Format 输出文件包括一行，A(m,n)的值。-Descr iption known Ackerman function definition (see the textbook). Enter only two integers: mn. Re
1206
- Descr iption 对给定一个Pascal源文件，请检查其中 (1)begin与end (2)if,then,else 是否合法配对。-Descr iption given a Pascal source file, check which (1) begin and end (2) if, then, else the legality of pairing.
banksuanfa
- House: through the experiment with the algorithm of programming language simulation bankers procedure law to strengthen the safety of understanding and mastery of the banker algorithm. Familiar with the method to avoid deadlock, deadlock and security
Transform
- preferential attachment图节点的偏好链接特性计算方法，参考论文Dynamics of Large Networks中的4.4节完成-Preferences link feature preferential attachment graph nodes calculation method, the reference paper Dynamics of 4.4 节 Large Networks of completion
queue
- 一个队列，可以放入任意类型和长度的数据，出入可加锁，在windows linux都可用，如果要用于linux,要改下锁的定义-a queue