搜索资源列表
119128649Waveletopti-trees
- 一种新型小波树构造程序，非常实用，值得期待。一般人不告诉他。-A novel wavelet tree structure procedures, very useful, it is worth looking forward to. Most people do not tell him.
INprinttree
- 凹入表的形式打印树 一先序遍历输入，把树转化成二叉树-Indentations in the form of a first print tree traversal input, the trees into tree
ext-tree
- ext的树的实例.通过右键菜单操作树节点对数据库进行增删改查.-Examples of trees ext. through the operation menu tree node additions and deletions to the database search.
SUMEYYEKOC
- How Trees Creates in C++ this very efficent sample
2808
- poj 2808 校门外的树 简单计算题-poj 2808 trees outside schools to easy calculation problems
ercahshu
- 树型结构和现实中的具有层级特点的问题的解决有很大关系,但并不局限于此.至于应用实例,可以有所谓二叉排序,查找算法,还有比如哈弗曼树等等.本ppt详细的介绍了二叉树结构，遍历等问题。 -Tree structure and the reality of the characteristics of the problem with the level there is a great solution, but not limited to this. As for example, you
Tree
- 多线程画树,在多线程的同步与异步中，线程互相不干扰出错，画出的树-Multi-threaded draw trees, many at the synchronous and asynchronous threads, the threads do not interfere with each other is wrong and draw the tree
Huffmanencoderdecoder
- 在发送端通过一个编码系统对待传输数据编码. 在接收端将传来的数据进行译码. 一个完整的系统应具有以下功能: (1)初始化.从终端读入字符集大小,以及字符和权值,建立 哈夫曼树,并保存. (2)编码.利用以建好的哈夫曼树对正文进行编码,然后保存. (3)译码.利用已建好的哈夫曼树将文件中的代码进行译码,结果打印出来. -At the sending end through a coding system for encoding transmit data treat
TwoTreeSynchronization
- Asp.Net 实现带选框的两棵树之间的增加，删除，转移-To achieve with Asp.Net box between the two trees to add, delete, transfer
hafumanshu
- 哈弗曼树和哈弗曼编码的源程序，很强大数 据结构上-哈弗曼trees and哈弗曼the source code, it is a powerful data structure d
Trees
- Tree datastructures programs- Tree datastructures programs...
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
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.
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.
1231988d4646243
- 遍历文件夹并生成文件数 树 十分好用！-Traversal folders and files with several trees very!