资源列表
红黑树检测
- 检测你输入的树是否为红黑树 红黑树是每个节点都带有颜色属性的二叉查找树，颜色或红色或黑色。在二叉查找树强制一般要求以外，对于任何有效的红黑树我们增加了如下的额外要求: 性质1. 节点是红色或黑色。 性质2. 根节点是黑色。 性质3 每个叶节点（NIL节点，空节点）是黑色的。 性质4 每个红色节点的两个子节点都是黑色。(从每个叶子到根的所有路径上不能有两个连续的红色节点) 性质5. 从任一节点到其每个叶子的所有路径都包含相同数目的黑色节点。
zkw线段树模板类
- zkw线段树模板类,可动态计算子区间最大值(Zkw line segment tree template class, which can dynamically calculate the maximum value of subintervals)
1
- 济南大学校园导航,,查询最短路径，校园景点查询，有条件最短路查询(University of Jinan campus navigation, query shortest path, campus attractions inquiry, conditional shortest path query)
thf-used
- 采用回溯算法对零件切割问题进行解决,内包含测试数据及详细问题描述和算法描述,(The backtracking algorithm is used to solve the part cutting problem, which contains the test data, the detailed problem descr iption and the algorithm descr iption.)
krogrammatrix
- 测量时,要用到矩阵相乘,此程序就是介绍的实矩阵的相乘(When measuring, use matrix multiplication, this program is the introduction of the real matrix multiplication)
VNQH
- 测试矩阵操作 所有数据是按照MATLAB中的矩阵操作例子来进行的(Test matrix operation, all data is done according to matrix operation example in MATLAB.)
1590183
- 此程序是关于动态规划算法的描述,可以直接 输入数据就可以直接运行,(This procedure is about dynamic programming algorithm descr iption, you can directly input data can be directly run.)
sovve
- 此程序为hdu的acm2010题,就是解决水仙花数问题(Hdu program for the acm2010 problem, is to solve the problem of daffodils)
algjrithm-the
- 查找第k小元素算法的实现,很实用的一个算法程序,欢迎大家下载(Look for the implementation of the k small element algorithm, very practical algorithm procedures, welcome to download)
kogo0
- 本软件一共收录了355个TC2 0库函数,每一个函数都提供了相应的头文件,函数用途,函数全称,输入输出参数,函数的返回值,以(A total of 355 TC2 0 library functions are included in this software. Each function provides a corresponding header file, function purpose, full name of function, input and output paramet
UYEO
- 本程序显示如何用C++类来创建和显示图像,这个C++类在 cxcore hpp 中定义,与 矩阵类(CvMatrix) 相似(This procedure shows how to create and display images with class C, which is defined in cxcore hpp, similar to the matrix class (CvMatrix))
zfsjzg
- 本程序是用C语言实现的实现fft快速算法(This procedure is implemented with C language to achieve a fast fft algorithm)