搜索资源列表
picture
- OpenGL绘制自然景物，有太阳、树木、绿地、天空-OpenGL rendering natural scenery, sun, trees, green, sky, etc.
BinarySearchHeapConstruction
- Binary Search Heap Construction-Read the statement of problem G for the definitions concerning trees. In the following we define the basic terminology of heaps. A heap is a tree whose internal nodes have each assigned a priority (a number) such that
BiTree
- 给定前序遍历和后序遍历的顺序，要求出总共有多少棵不同形态的二叉树满足这样的遍历顺序。-To order preorder and postorder before setting requires the total number of trees of different forms of binary tree traversal order to meet this.
algorithms
- Data structures and algorithms, AVL trees,rank finding algorithms, Fibonacci tree
Binary-Tree
- Binary search trees (BST), sometimes called ordered or sorted binary trees, are a particular type of containers: data structures that store items (such as numbers, names etc.) in memory.-Binary search trees (BST), sometimes called ordered or sorted b
PolytomySolversample
- 给定一个非二进制基因树和二进制的树种，发现的基因树的重复和损失最小的最优算法PolytomySolver-Given a non-binary gene trees and binary trees, duplication and loss of genes found in the smallest tree optimal algorithm PolytomySolver
PAPER3
- Fault diagnosis of induction motor based on decision trees and adaptive neuro-fuzzy inference
BST3_array
- In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A recursive definition using just set theory notions is that a (non-empty) binary tr
AVL
- Test program for AVL trees.
Binary-Tree
- 二叉树通过字符串方式，能够创建相应的二叉树，而且可以递归实现。同样，对于任意的二叉树，可以生成对应的字符串。包括从指定字符串形式创建二叉树（包括空树和平凡树）、将二叉树按照指定的字符串形式输出、判断是否空树、 计算二叉树的结点总数、计算二叉树的叶子总数、计算二叉树的高度，其中空树和平凡树的高度分别为0和1、前序遍历输出二叉树，逗号分隔、中序遍历输出二叉树，逗号分隔、后序遍历输出二叉树，逗号分隔、将树清空等功能-By way of binary string, you can create t
p2
- For pointer logic and trees for intro computer cla-For pointer logic and trees for intro computer class
Orderedtree
- 输入整数n，输出n个数组成的排列树的组合。-Enter integer n, output n number of trees formed a combination arrangement.
MachLearn_ml
- MachLearn:已经实现了朴素贝叶斯分类器、决策树、支持向量机算法。在Linux上可成功编译-MachLearn: has achieved a naive Bayes classifier, decision trees, support vector machine algorithm. Successfully compile on Linux
destoon_miaomu_v4.0
- 软件介绍 花木网、苗木网源码是基于destoon v4.0而开发的苗木类企业网站。该程序的主要功能包括：当前已发布会员、分站、商城、供应、求购、行情、公司、展会、文章、信息、品牌、团购、图库、专题、视频、下载、人才、知道等模型。-Software introduction Flowers and trees, seedlings seedlings is net net source of enterprise website based on destoon v4.0 and the
code
- 机器学习 R语言对与数据进行分类，包括决策树，SVM，贝叶斯，percepttron等算法。需要注意之前要安装相应的R工具包。具体工具包名称百度一下就能容易获取。-R for language and machine learning to classify data, including decision trees, SVM, Bayesian, percepttron algorithm. To install the appropriate R toolkit before need t
xgcode_tree
- 许愿树成长过程：树苗->树->枝叶->开发->结果-Wishing Tree growing: trees-> trees-> leaves-> Development-> Results
OAP-Solutions-and-Figures
- Solution manual and figure files for optimum array processing , Hurry L.Van Trees,Wiley Interscience, 2002-Solution manual and figure files for optimum array processing , Hurry L.Van Trees,Wiley Interscience, 2002
c
- 区间树，创建区间树，插入删除和搜索操作。 红黑树创建查询删除。 二分查找，多种排序方式实现，快速矩阵运算实现-Interval trees, create a range of trees, insert and delete search operation. Create a query remove red-black tree. Binary search, sorting various ways, matrix operations to achieve fast
Pythagor_tree
- 毕达哥拉斯树是由毕达哥拉斯根据勾股定理所画出来的一个可以无限重复的图形。又因为重复数次后的形状好似一棵树所以被称为毕达哥拉斯树。直角三角形两个直角边平方的和等于斜边的平方。两个相邻的小正方形面积的和等于相邻的一个大正方形的面积。而同一次数的所有小正方形面积之和等于最大正方形的面积直角三角形两个直角边平方的和等于斜边的平方。-Pythagoras Tree Pythagoras Pythagorean theorem is drawn out of a pattern can be repeate
BFS_graph
- 这是数据结构中图的广度优先算法的实现。广度优先算法是按照每个节点的拥有的孩子数目来进行遍历的。而不像图的深度优先算法是按照深层次，然后如果不能继续进入更深一层，就往回遍历。-BFS program of tree have a large of difference of the DFS program of trees.The produre of it is with the method of the children of a point ,rather than the depth o