搜索资源列表
Programs
- 数值分析算法,密码Jacobi符号计算,数据结构中二叉树判定及一元稀疏多项式计算。-Numerical analysis algorithms, password Jacobi symbol calculations, the data structure sparse binary polynomial to determine and calculate a dollar.
xianduanshu
- 本程序用C编写,陈述了“线段树”的具体操作方法-This program written by C, the statement of the " tree line" of the specific methods of operation
95637012Multiplier
- 一种可以完成16位有符号/无符号二进制数乘法的乘法器。该乘法器采用了改进的booth算法,简化了部分积的符号扩展,采用Wallace树和超前进位加法器来进一步提高电路的运算速度。本乘法器可以作为嵌入式CPU内核的乘法单元,整个设计用VHDL语言实现。- This file contains all the entity-architectures for a complete-- k-bit x k-bit Booth multiplier.-- the design makes use of
sleuth
- sleuth算法是用来挖掘无序频繁嵌入子树,通过给定最小支持度和数据库,输出所以频繁嵌入无序子树。-sleuth mining algorithm is used to frequent embedded unordered subtrees, by a given minimum support and database output so frequent embedded unordered subtrees.
Assignment
- 计算水力学河网计算,用VC++编写的程序,可以用来计算简单的树状河网的水位和流量-calculation of River network for Hydraulic calculation。With vc++ program is writen by VC++,which can be used to simply calculate of water level and flow in dendriform river network
HuffTreeCodec
- 哈弗曼树的算法编码,理解这个以后可以看看突变压缩之类的书籍,会很有帮助的-Ha Fuman tree algorithm code, understand the future can look like mutant compressed books will be helpful
plus
- 该程序以解决日常生活中的三个树的加法运算为主要目的-with this program,you can easily slove the problem of plus
birch
- BIRCH(Balanced Iterative Reducing and Clustering using Hierarchies)是一个综合的层次聚类算法。它用到了聚类特征(Clustering Feature, CF)和聚类特征树(CF Tree)两个概念,用于概括聚类描述。聚类特征树概括了聚类的有用信息,并且占用空间较元数据集合小得多,可以存放在内存中,从而可以提高算法在大型数据集合上的聚类速度及可伸缩性。 -BIRCH (Balanced Iterative Reducing and
TREECODE3D_1_0.tar
- 树结构程序,3 Dimensionsdfa sdf-tree fortran code 3 Dimensiondfgadgaeg
treecode.tar
- 树结构程序,建立三维的单元网格八叉树分层结构。-tree fortran code 3 Dimension,creat 3d elements tree structure.
tree
- 设T 是一棵带权树,树的每一条边带一个正权。又设S 是T 的顶点集,T/S 是从树T 中 将S中顶点删去后得到的森林。如果T/S中所有树的从根到叶的路长都不超过d ,则称T/S 是一个d 森林。-this is a project
binary
- 二叉树方法计算信用风险溢价 参数说明: V:公司资产市场价值初值 r:市场无风险利率 sigma:企业资产市场价值波动率 T:期限 num:二叉树层数 dp:违约点,即债权价值 输出结果: M:公司的风险溢价 -The binomial tree method to calculate the credit risk premium Parameters: V: t
01Bags_BinaryTress
- 自己写的用二叉树处理经典的0-1背包问题的程序。-Write your own binary tree processing procedures of the classical 0-1 knapsack problem.
Tree_TDS
- 基于多叉树后序遍历的VB实现方法。本方法有效解决复杂拓扑关系的分析,可广泛用于流域洪水演算和水资源配置中-VB method based on multi-tree postorder traversal. This method is effective to solve complex topological analysis of the relationship can be widely used in the river basin flood routing and allocat
testbtree
- 将树型显示在屏幕上。全部关键字插入完毕时显示树型,之后每完成一次插入或删除操作后也显示当前的树型。-The tree is displayed on the screen. All keyword insertion is complete display tree, also displays the current tree after each time you insert or delete operation.
2
- 掌握二叉树的链式和顺序存储结构,利用队列对二叉树进行运算。 二、实验内容: 1) 编写函数creatbt,其功能是将一维数组方式存储的二 叉树转化为链式存储的二叉树,返回root指针。 2) 编写函数freebt,其功能是释放二叉树链表节点的存储 空间。函数原型为:void freebt (TNODE * root) 3) 编写函数实现前序、中序和后序遍历; -Master chain and sequential storage structure of the binar
elyar-code
- 这是一个AC算法程序,可以从树结构中找到关键词,很实用。-This is an AC algorithm, keywords can be found in the tree structure, very practical.
compete
- 构建语法树,自动生成运算表达式,面向对象,易于扩展-Build syntax tree, automatically generate arithmetic expressions, object-oriented, easy to expand
exp8
- 对二叉树的删除、复制、中序遍历采用递归方式实现。 层序遍历采用辅助队列数据结构完成,为了计算层高, 使用了两个队列,交替的向两队列中插入相邻的两层, 这样完成层高的统计。-On the binary tree delete, copy, preorder recursive manner. Traversal sequence complete with assisted queue data structure, in order to calculate storey,
exp4
- 二叉树是一种重要的数据结构 。 通过 实现二叉树的一系列操作,帮助 实现二叉树的一系列操作,理解 和掌握链式存储二叉树的性质 -Binary Tree is an important data structure. By implementing a series of binary operations, a series of actions to help achieve binary tree, understand and grasp the nature of chain stor