Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - Tree

Search list

[Browser Client] tree

Description: 功能齐全的树功能,包括接点的增加\删除\修改\移动\重命名等常用功能-Full-featured tree features, including an increase in contact delete modify mobile rename commonly used functions, such as
Platform: | Size: 17408 | Author: 范敬良 | Hits:

[Data structs] Tree

Description: 树（Tree）中的各种经典操作，如遍历，查找节点，删除节点，等等。-Tree (Tree) in a variety of classic operation, such as traversal, find nodes, delete nodes, and so on.
Platform: | Size: 27648 | Author: 王新新 | Hits:

[Data structs] tree

Description: 用二叉树实现重言式真假的判别问题,对于矛盾式可以进行自己输入值判断-With binary tree to achieve true tautology Discriminant problems contradiction can enter their own value judgments
Platform: | Size: 2048 | Author: 李天宇 | Hits:

[JSP/Java] monkey-tree

Description: java 实现的动态树 java 实现的动态树-java to achieve the realization of dynamic tree java dynamic tree
Platform: | Size: 10240 | Author: xinyi | Hits:

[Documents] Binary-Tree

Description: 数据结构 1、算法思路： 在此二叉树操作中，主要采用链式存储结构，由于遍历二叉树基本操作是访问结点，则不论按哪一种次序进行遍历，对含有n个结点的二叉树，其时间复杂度均为O(n)；空间复杂度为二叉树的高度。 -Data Structure 1, Algorithm idea: In this binary tree operation, mainly the structure of chain stores, due to the basic operation is a binary tree traversal to visit nodes, regardless of by what kind of order traversal, containing n- node of the tree, its time complexity are O (n) space complexity for the tree height.
Platform: | Size: 29696 | Author: Anson | Hits:

[Documents] Huffman-tree

Description: 数据结构 1、算法思路： 哈夫曼树算法：a）根据给定的n个权值{W1，W2… ，Wn }构成 n棵二叉树的集合F={T1，T2…，T n }，其中每棵二叉树T中只有一个带权为W i的根结点，其左右子树均空；b）在F中选取两棵根结点的权值最小的树作为左右子树构造一棵新的二叉树，且置新的二叉树的根结点的权值为其左、右子树上结点的权值之和；c）F中删除这两棵树，同时将新得到的二叉树加入F中； d）重复b)和c),直到F只含一棵树为止。 -Data Structure 1, Algorithm idea: Huffman tree algorithm: a) in accordance with a given value of n of the right (W1, W2 ..., Wn) constitute a set of n binary tree trees F = (T1, T2 ..., T n) , which for each binary tree T with only one right for the W i of the root node, its about subtree are empty b) in the F 2 in the root node of the right to select the smallest value of the tree as a subtree structure around a new binary tree, binary tree and the new home of the root node of the right value for the left and right sub-tree nodes and the right value c) F in the deletion of the two trees, at the same time obtained by adding a new binary tree F in d) repeat b) and c), until a tree F containing only so far.
Platform: | Size: 28672 | Author: Anson | Hits:

[Other] tree

Description: Js写的树。可以直接在浏览器中显示。-Js written tree. Can be directly displayed in a browser.
Platform: | Size: 6144 | Author: macroping | Hits:

[Data structs] tree

Description: c语言编写的B+树，可实现树的构造和记录查找。-c language B+ tree, the tree structure can be achieved and records to find.
Platform: | Size: 182272 | Author: Y.A.M | Hits:

[JSP/Java] TREE

Description: 树型目录的好帮手very good treeview-Directory tree a good helper very good treeview
Platform: | Size: 13312 | Author: hezanyong | Hits:

[JSP/Java] window-tree

Description: ＪＡＶＡ实现ＷＩＮＤＯＷＳ文件管理，以树形显示文件-JAVA realize WINDOWS file management in order to show the document tree
Platform: | Size: 7168 | Author: helongfei | Hits:

[Data structs] rb-tree

Description: 红黑树的算法，网上有好多例子，包括移植STL中的RBTREE算法，但是我试了，不怎么好用阿。 这是麻省理工数据结构课程的一个实现，我把它改造了一下，经过30-40万的数据量测试 windows/unix下都做过测试，没有问题。-Red and black tree algorithm, the Internet has a lot of examples, including the transplantation of STL algorithms RBTREE, but I tried, not very easy to use the Arab-Israeli. This is the Massachusetts Institute of Technology, a data structure course realize, I modified it a bit, after 30-40 million the amount of data to test windows/unix done under test, no problem.
Platform: | Size: 5120 | Author: zhi | Hits:

[TreeView] tree

Description: 一个很好的tree控件,对学习界面开发有指导作用.-A very good tree control, of learning to develop the guiding role of the interface.
Platform: | Size: 28672 | Author: jordan | Hits:

[TreeView] drag-drop-folder-tree

Description: 一个功能非常强大的动态树，可以实现结点的拖拉，还可以点击右键-A very powerful dynamic tree, you can drag nodes realize, you can right-click
Platform: | Size: 29696 | Author: yoncher | Hits:

[Data structs] tree

Description: 完成二叉树的初始化、遍历以及相应的操作-Complete binary tree initialization, ergodicity and the corresponding operation
Platform: | Size: 1024 | Author: | Hits:

[Data structs] tree

Description: 表达式类型的实现: 1、 一个表达式和一颗二叉树之间，存在着自然的对应关系。 2、 假设算术表达式Expression内可以含有变量（a～z）、常量（0～9）和二元运算符（＋，－，*，/，^）。实现一下操作。 （1） ReadExpr(E)——以字符序列的形式输入语法正确的前缀表示式并构造表达式E。 （2） WritrExpr(E)——用带括弧的中缀表示式输出表达式E。 （3） Assign(V,c)——实现对变量V的赋值(V=c),变量的初值为0。 （4） Value(E)——对算术表达式E求值。 （5） CompoundExpr(P,E1,E2)——构造一个新的复合表达式（E1）P (E2)。 -Realize the type of expression: one, an expression, and between a binary tree, there is a natural correspondence between. 2, assuming that the arithmetic expression Expression can contain variables (a ~ z), constant (0 ~ 9) and binary operators ( ,-,*,/,^)。 You realize the operation. (1) ReadExpr (E)- sequence of characters in the form of input grammar correct prefix expressions and tectonic expression of E. (2) WritrExpr (E)- used within parentheses express output infix expression E. (3) Assign (V, c)- realize the value V of the variables (V = c), variable initial value is 0. (4) Value (E)- on the arithmetic expression E is evaluated. (5) CompoundExpr (P, E1, E2)- Construction of a new composite expression (E1) P (E2).
Platform: | Size: 58368 | Author: | Hits:

[xml-soap-webservice] tree

Description: xml树，利用JS读取，可以在网站后台中使用，-xml tree, use JS to read, you can use the background on the site,
Platform: | Size: 2048 | Author: jj | Hits:

[OpenGL program] Tree

Description: 使用openGL，通过递归生成树形分形图-Use openGL, generated through the recursive tree-like fractals
Platform: | Size: 1024 | Author: fangqiang | Hits:

[Delphi VCL] tree

Description: 这是一个对树进行的动态生成,不需要在表单里输入如何文本,就是通过sql2000数据库里的数据产生树菜单-This is a dynamic tree generation, do not need to enter in the form of how the text is through the SQL2000 database data generated tree menu
Platform: | Size: 269312 | Author: 余六 | Hits:

[Data structs] b-tree

Description: 程序名称： B-树的实现 创建时间： 2008.03.16 最后修改： 2008.03.18 程序作者： monkeylee 联系方式： leeocean2004@163.com 程序说明：实现B-树的相关操作，查找插入删除 -Name: B-tree realize the creation of Time: 2008.03.16 last modified: 2008.03.18 procedures Author: monkeylee Contact: leeocean2004@163.com program Description: B-tree realize the relevance of the operation, find insert delete
Platform: | Size: 3072 | Author: leeocean | Hits:

[AI-NN-PR] tree

Description: 一段简单的代码， 使用C++实现模式识别中最小生成树的算法， 具体详见源代码-For some simple code, using C++ Realize pattern recognition in the minimum spanning tree algorithm, the specific details, see the source code
Platform: | Size: 3072 | Author: JustSea | Hits:
« 1 2 34 5 6 7 8 9 10 ... 50 »

CodeBus www.codebus.net