搜索资源列表
Huffman
- 给出节点及节点上的值,生成huffman树,并输出结果-Give the value of the node, generate the Huffman tree, and output the results.
Erchashushiyan
- visual studio编程,数据结构中的二叉树实验,测试新建5个节点,以及新节点的插入,之后完成遍历。-insert visual studio programming, data structures binary experiments, test new five nodes, and the new node, then complete traversal.
delphi写的权限管理
- 将树型结构的节点写进数据库,进行动态修改。在程序中动态生成树型结构
ID3
- MATLAB下的决策树ID3算法,应用信息增益来划分节点-ID3 decision tree algorithm under MATLAB application information gain to divide the node
FindTargetAndReturnPathInBinaryTree
- 实现了在二叉树中找到定值的所有路径的结果。路径是指从根节点到叶子节点的所有节点。-Results found all paths to achieve a given value in the binary tree. Path refers to all nodes the root to the leaf nodes.
ext3x--half-tree
- ext js 的半选树,和一般的全选树的区别是如果子节点有部分选中,部分不选中,则父节点半选样式-Ext js half selected tree, and the general selection tree if there is a part of the selected child nodes, is the difference between a part is not selected,the parent node half choose style
KBMPH
- 图论中的kbmph算法,用于解决基于加权节点的Steiner树问题-Graph theory kmp algorithm for solving the problem based on a weighted Steiner tree node
KMB
- 图论中KMB算法,用于解决加权节点的Steiner树的问题。-KMB graph theory algorithms for solving weighted Steiner tree problem nodes.
birprate-tree
- 二叉树构建及遍历方式,深度宽度,叶子节点,顶点数,等各种计算-Binary Tree Construction and traversal, depth width, leaf node, the number of vertices, and other computing
Binarytree
- 实现对线索二叉树进行节点的插入与删除等操作-Clues to achieve the establishment of a binary tree, add and remove nodes
hw9
- 树结构的运用,树的遍历,叶子节点,广搜深搜及其实现,很多功能都有-tree achieve
1
- 给定一颗有权无根树,修改任意一条边,求最少的任意两点间的距离和:修改一条边是指删除树中的一条边,然后选择两个端点连线,形成一课新的树,并且不改变这条边的权值,在这棵树的基础上,求最少的任意两点间的距离和是多少 任意两点的距离和指:sum(a到b的距离,a<b,a和b都是树上的点) 输入:第一行是整数n,接下来n-1行,每行包括3个整数ai,bi,wi,表示节点ai与bi之间有一条权重为wi的边。 输出:最小的任意两点间的距离和 -Given a right to u
Octree_openGL
- 使用VS2010编写的空间八叉树,可以根据用户需要的深度创建八叉树,同时使用OpenGL将八叉树每个节点进行显示,需要自行配置OpenGL环境-Space prepared using VS2010 octree, you can create octree depth according to user needs, while using OpenGL octree will be displayed for each node, you need to self-configured Op
kong-jian-shu-ju
- 一棵具有n个节点的完全二叉树以顺序方式存储在数组A中。设计一个算法构造该二叉树的二叉链存储结构。-Complete binary tree with n nodes in a sequential manner are stored in the array A. Design an algorithm constructed binary chain storage structure of the binary tree.
hash_tree
- C++编写的二叉哈希树,根据每个比特位的奇偶进行哈希,最终得到哈希的叶子节点。即由输入的数值得到哈希的叶子节点。-hash tree by c++
QUERYsplay
- 一个动态线段树,支持添加,修改节点,可以进行区间求和(通过修改ps函数可以做到更多,详情见代码)-A dynamic segment tree, supports add, modify nodes can be summed interval (ps function can be done by modifying more details see code)
Heapsort
- 堆排序是指利用堆这种数据结构所设计的一种排序算法,它是选择排序的一种。可以利用数组的特点快速定位指定索引的元素。堆分为大根堆和小根堆,是完全二叉树。大根堆的要求是每个节点的值都不大于其父节点的值,即A[PARENT[i]] >= A[i]。在数组的非降序排序中,需要使用的就是大根堆,因为根据大根堆的要求可知,最大的值一定在堆顶。-Heapsort refers to a sorting algorithm data structure designed using the heap, it
huffmam
- 霍夫曼编码实现文件 构建霍夫曼树 编码与解码 需要511个节点才能构成霍夫曼树-Huffman Coding file to build the Huffman tree encoding and decoding require 511 nodes in order to constitute a Huffman tree
Btree-Node
- 输出二叉树指定节点所在位置,迅速寻找到二叉树-Find the certain site in the BTree
BPTree
- b+树能够实现节点添加,节点删除,节点查找功能,非常适合初学者学习-b+ tree node can be achieved to add, delete nodes, node search function, very suitable for beginners to learn