搜索资源列表
Cpp1
- 输入一段数据，实现哈弗曼树的生成，并输出哈弗曼编码。-Enter a data to achieve Huffman tree generation, and outputs the Huffman coded.
HDU1671DictionaryTree
- 杭州电子科技大学ACM评价系统1671题字典树的解法-Hangzhou University of Electronic Science and Technology Evaluation System 1671 ACM dictionary tree problem solution
BST
- 用动态规划解答最优二叉查找树问题，最优二叉搜索树-Using dynamic programming solution optimal binary search tree problem with Optimal binary search tree
cumulate
- 多层次关联规则挖掘算法：cumulate 可以支持跨层的关联规则挖掘。数据集为T10I4D100K，概念层次树有10个根节点，分三层。-Multi-level association rule mining algorithm: cumulate to support cross-layer association rule mining. Dataset T10I4D100K, has 10 concept hierarchy tree root, divided into three lay
Gauss-Seidel
- 数值线性代数（徐方树）第四章上机题 G-S迭代法 希望有帮助-Numerical linear algebra (Xu Fangshu) the fourth chapter on the topic G-S iterative method I hope there is help
MultivariateDecisionTree-
- 单变量的决策树算法造成树的规模庞大,规则复杂,不易理解。本文结合粗糙集原理中的相对核及加权粗糙 度的方法,提出了一种新的多变量决策树算法。 -Decision Tree Algorithm in univariate tests caused large-scale, complex rules that are difficult to understand. Based on the rough sets theory of attributes reduction, the c
Decisiontree
- 实现基本功能的决策树分类算法，可以对连续变量进行处理，能显示生成的决策树。-Basic functions of decision tree classification algorithm for continuous variables can be processed to show the resulting decision tree.
tree
- 决策树分类的各种代码,包括ID3、c4.5等等，有界面可以运行-Various code of decision tree classification, including ID3, C4.5 and so on, there are interface can run
123456
- 排序二叉树的建立 bala bala bala -the establish of paixuerchashu
btree
- 利用fortran编写的二元树排序例子，是利用fortran排序的经典例子-Fortran prepared utilizing binary tree sort example, is sort of a classic example of the use of fortran
Desktop
- 先序遍历二叉树算法、语音程序模板、约瑟夫数判定、判断素数-void preorder 、voice procedure templet、The Joseph number 、judge a prime number
craft
- 给定任意一组码长，根据克拉夫特不等式判断是否能得到二元即时码。如果能，利用二叉树编制二元即时码。-Given any set of yards long, according to Kraft s inequality to determine whether two yuan can get instant code. If you can, use binary code compiled two yuan immediately.
Tree
- 数据结构对二叉树结构的C++代码实现，包含基本的建立二叉树，各种方式遍历二叉树，深度计算、结点个数计算-Data structure of binary tree structure of the c++ code, include the establishment of the basic binary tree, various ways to traverse the binary tree, depth calculation and node number calculation,
matlab-
- matlab分形（Sierpinski垫片、Koch 雪花、分形树）-matlab fractal (Sierpinski gasket, Koch snowflake, fractal tree)
huffman
- huffman 树的c语言实现程序 自己编的 是以前的作业-the translation of huffman tree
Goal_programming_model_sparse
- 针对多期随机规划问题，利用情景树方法来求解-For multi-period stochastic programming problems, the use of scenarios to solve Tree
rrt_simplify
- 在VC6.0上实现了简化的快速扩展随机树算法，实现了人工放置起点，终点和障碍点。算法自动生成避开障碍的路径。注释详细，具有较好的参考价值。- a simplified algorithm of fast expanding random tree in VC6.0 is implemented, and the starting point, end point and obstacle point of artificial placement are realized. Algorithm
DMtree
- 我写的计算宇宙学常用的code。DMtree是用来建立暗物质晕并合树-cosmological calculations commonly used code. DMtree is used to create the dark matter halo merging tree
checkint
- 建立二叉树求解整数规划，非常实用，欢迎互相交流-Build binary integer programming solver, very practical, welcomed the exchange
ym_cpp-heimantree
- 哈夫曼编码是可变字长编码(VLC)的一种,一个C++ 夫曼树例子源程序 .-Huffman coding is a variable word length coding (VLC) A, a C++ source code examples Huffman tree.