搜索资源列表
IDE
- The matlab code implements the ensemble of decision tree classifiers proposed in: "L. Nanni and A. Lumini, Input Decimated Ensemble based on Neighborhood Preserving Embedding for spectrogram classification, Expert Systems With Applications doi:10.101
trees_demo
- its a demonstration of trees being emerging.... they appear like christmas tre-its a demonstration of trees being emerging.... they appear like christmas tress
minspantree
- 最小生成树的克鲁斯卡尔算法 采用邻接矩阵存储图，用树表示和实现集合操作-Kruskal minimum spanning tree algorithm uses the adjacency matrix memory map, with trees and realize that the collection operation
hfmtree
- 我自己写的一个赫夫曼编码器/译码器程序，实现了初始化、编码、译码、打印赫夫曼树等功能。-I wrote it myself as a Huffman encoder/decoder program to achieve the initialization, encoding, decoding, printing features such as Huffman trees.
sjjg4-6
- 数据结构ppt教程，第4章讲述的是串,第5章讲述的是数组，第6章讲述的是树和二叉树-Data structure tutorial ppt, Chapter 4 is on the string, described in Chapter 5 is an array, Chapter 6 is about trees and tree
trees
- 树的和 ★问题描述 LISP是一种高级语言，可以用它来表示其它的数据结构，例如二叉树。二叉树由LISP的S 表达式来表示，其规则如下： 空树=() 树= (整数 左子树 右子树) 叶节点=(整数 () ()) ★编程任务 问题是给定一棵由LISP的S表达式决定的二叉树，问是否存在一条从根到叶节点的路径 P，使这条路径上所有节点的和等于一个给定的整数I。 ★数据输入 由文件input.txt给出输入数据。每个输入数据包含多组数据，每组数据包含一个整数I和
vp_tree_halo
- vp场景中树木的显示以及creator中树的模型和材质-vp scene of trees, as well as creator of the show in the tree model and material
VCGraph
- 计算机图形学中常用的方法，如圆的画法，树的画法，综合实现乡村别墅的画法-Commonly used in computer graphics methods, such as circle drawing, painting trees, to achieve integrated rural villa painting
1
- 在一般的数据结构的书中，树的那章后面，著者一般都会介绍一下哈夫曼(HUFFMAN)树和哈夫曼编码。哈夫曼编码是哈夫曼树的一个应用。哈夫曼编码应用广泛，如JPEG中就应用了哈夫曼编码。 首先介绍什么是哈夫曼树。哈夫曼树又称最优二叉树，是一种带权路径长度最短的二叉树。所谓树的带权路径长度，就是树中所有的叶结点的权值乘上其到根结点的路径长度（若根结点为0层，叶结点到根结点的路径长度为叶结点的层数）。树的带权路径长度记为WPL=(W1*L1+W2*L2+W3*L3+...+Wn*Ln)，N
prb7_1
- It s an interface for using sorting binary trees (data structure application) and a test program with CLI in a form of a menu to test those features.
Prb_Noname
- It s an interface for using huffman trees (data structure application) that can be used for compression and a test program with CLI in a form of a menu to test those features.
arboreB
- It s an interface for using B trees (data structure application) which are the basic data form used in database systems.. and a test program with CLI in a form of a menu to test those features.
TrieTrees
- It s an interface for using Trie Trees (data structure application) (used for implementing optimal sets...with applications on text data as input...foe example dictionaries) and a test program with CLI in a form of a menu to test those features.
foresterv1full
- forest visualization and 3d trees and 3d terrain
LibraryManagementSystem
- 本软件利用VC++树结构，构建图书馆管理系统,很有学习价值!-Use trees to build a library management system!
1231988d4646243
- 遍历文件夹并生成文件数 树 十分好用！-Traversal folders and files with several trees very!
TREES
- 森林的层次遍历、广义表形式输出等关于森林的一些基本操作-Traverse the level of the forest, such as the generalized form of the output on some of the basic operation of the forest
max
- 将数组中元素按列进行排序，排序完的数组被重新放在原树组当中-Array elements will be sorted by column, to sort the array after the original trees were re-group on which
decision-trees_lisp
- 决策树,Machine Learning, Tom Mitchell, McGraw Hill,第3章决策树源码-decision-trees
IntervalSearch
- 区间树上的重叠区间查找算法:通过增加树结点的信息域将红黑树扩张为区间树，并通过给定的某个区间i，查找区间树上相应的重叠区间。-The overlap interval between the tree search algorithm: tree node by increasing the information domain will be red and black tree expansion for the interval tree, and through a given inte