搜索资源列表
My_eclat
- A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm i
My_relim
- A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm i
wuziqi1100
- 这里设计和实现了一个人机对下的五子棋程序，采用了博弈树的方法，应用了剪枝和最大最小树原理进行搜索发现最好的下子位置。介绍五子棋程序的数据结构、评分规则、胜负判断方法和搜索算法过程。-here Design and Implementation of a crew of 331 under the procedures adopted Game tree, Application of pruning trees and the largest and most principle Search
promptshaderey
- 本程序为一个非真实渲染的DEMO以非真实渲染(none-photorealistic rendering)风格，对户外场景进行着色的技术。在2003年秋天的Beyond3D/ATI shader compititon中，Shaderey程序最先使用了这些技术来进行渲染。在Shaderey的户外场景中，包含了地形，云，树木，房屋，天空顶，以及湖水.-the procedures for a non-realistic rendering of the DEMO non-realistic rend
hdjd
- 图象程序的眼格畸安定内的产生深刻机好看上和开会回答棵和好看大会可好看 -image of the eye procedures Lattice'11 stability within the machine have a profound and beautiful trees and answer meeting the General Assembly could look good!
Getsight
- 可以生成山、火焰、树与草等自然景物的实例-can generate Hill, flame trees and grass and other natural features examples
binarytreetranverse
- 用汇编实现二叉树的遍历,提示输入左右子树显示结果-compilation of achievement with the binary tree traversal, suggesting that the importation of sub-trees around results show
manytrees
- 常用树数据结构集合，包括二叉树、二叉查找树、AA树、红黑树、伸展树的一整套实现，自带包装器、异常处理类，方便使用-common pool tree data structure, including the binary tree, binary search tree, AA tree, a red, black tree extend to achieve a set of trees, bringing their wrapper, abnormal class, user-friendl
Trees
- 用C++制作家谱-C production records
shujujeigou
- 详细介绍了数据结构中关于树和图的相关知识,并通过C语言实现了关于树和图的个种操作,是学习C语言和数据机构的很好好材料-detailed data on the structure of the tree and plans related knowledge, and through C language on the map of the trees and the species of operation, is learning C language and the good data g
zuixiaoshengchengshu
- 最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications netw
E51_0230
- 一:需求分析 1．本程序需掌握树和二叉树的概念及工作原理，运用其原理及概念完成实验.。 2．问题描述： 一个逻辑表达式如果对于其变元的任一种取值都为真，则称为重言式；反之，如果对于其变元的任一种取值都为假，则称为矛盾式；然而，更多的情况下，既非重言式，也非矛盾式。试写一程序，通过真值表判断一个逻辑表达式属于那一类。 3．基本要求： （1）逻辑表达式从终端输入，长度不超过一行。逻辑运算符包括“|”，“&”和“~”, 分别表示或、与和非，运算优先程度递增，但可以有括号改变，
tc20
- 画一系列同心圆．画任意直线．可是机度度个斤秒磅 结合能 飞机暖和棵；知识个时立刻机似的集散地风格内码饿哦派艰苦搞活啊-painting a series of concentric circles. Arbitrary linear paintings. But machine-jin degrees degrees seconds pounds warmer air will combine trees; immediately when knowledge-machine style sim
shu
- 1.[问题描述] 编写递归算法，计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出，输出的结果为；dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点，然后建立其左右子树，直到空子树为止，中序遍历二叉树时，先遍厉左子树，后遍厉右子树，最后访问根结点。根据左右子树的最后一个
prog3_3_pc
- DAGON Approach Object of this exercise: Given a subject graph and a set of pattern graph in canonical representation (2-input NAND and INV), implement the second step of DAGON approach. (Both the subject graph and the pattern graphs are trees
icsiboost-0.3.tar
- Boosting is a meta-learning approach that aims at combining an ensemble of weak classifiers to form a strong classifier. Adaptive Boosting (Adaboost) implements this idea as a greedy search for a linear combination of classifiers by overweighting the
minbinoheapandminleftisttree
- This code implements min binomial heaps and min leftist trees.Plus, measure and compare the relative performance of these two implementations under the assumption that the only permissible operations are insert and delete-min.
trees
- 用C＋＋编的关于二叉树的一些内容，学数据结构必用到，算法设计
生成山峦、焰火、树和草的程序
- 可以生成山峦、焰火、树和草的一个程序-can generate hills, fireworks, trees and grass in a process
appletree
- 用OpenGL画的一个苹果树林~~可当作业用-with OpenGL painting an apple trees ~ ~ can be used when operating