Location:
Search - t-tree
Search list
Description: 实现一个B*Tree的添加和查找，输入数据为一组字典文件-achieve a B * Tree Search and the addition, the input data for a group of documents dictionary
Platform: |
Size: 3434 |
Author: Ren Kai |
Hits:
Description: 给定一棵树T，树中每个顶点u都有一个权w(u)，权可以是负数。现在要找到树T的一个连通子图使该子图的权之和最大。-given a tree T, tree each vertex u have a right to w (u), the right to be negative. Now to find a tree T connectivity graph so that the graph of the rights and the largest.
Platform: |
Size: 150268 |
Author: wu |
Hits:
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只含一棵树为止。
Platform: |
Size: 28278 |
Author: Anson |
Hits:
Description: Tree views are capable of storing hierarchical data, which isn t intuitively serialized. The TreeStore sample is an MDI application which shows a view based on CTreeView and demonstrates loading and saving the content of the control with MFC s CArchive-based serialization. The code is also rife with calls to the item navagation routines of CTreeCtrl, including GetNextSiblingItem(), GetPrevSiblingItem(), and GetParentItem().
Platform: |
Size: 41984 |
Author: 陈伟 |
Hits:
Description: 数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T's average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of the outstanding balance of two fork-tree and balanced binary tree s
Platform: |
Size: 4096 |
Author: 洪玲叶 |
Hits:
Description: 空间数据库中空间数据结构的应用，K-d树基本操作的源码，都在这个文档中。-spatial database structure of the data space applications, K-d trees basic operation of the source code in the documents.
Platform: |
Size: 6144 |
Author: 周琳 |
Hits:
Description: Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage ? If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in which that node lies. This is my initial motivation for writing a storage-media independent AVL Tree. However, as you step forth, you would find that it not only works fine with disks but also fine with memorys, too.-Although there has been a lot of AVL tree libraries available now, nearly all of them are meant to work in the random access memory(RAM). Some of them do provide some mechanism for dumping the whole tree into a file and loading it back to the memory in order to make data in that tree persistent. It serves well when there s just small amount of data. When the tree is somewhat bigger, the dumping/loading process could take a lengthy time and makes your mission-critical program less efficient. How about an AVL tree that can directly use the disk for data storage If there s something like that, we won t need to read through the whole tree in order to pick up just a little bit imformation(a node), but read only the sectors that are neccssary for locating a certain node and the sectors in whic
Platform: |
Size: 87040 |
Author: 高名 |
Hits:
Description: C-C方法及改进的C-C方法重构相空间的matlab程序
--------------------------------
性能：
3000数据耗时3分钟
--------------------------------
参考文献：
1、Nonlinear dynamics, delay times, and embedding windows.pdf
2、基于改进的C-C方法的相空间重构参数选择4.pdf
--------------------------------
文件夹说明：
1、C_C_Method_luzhenbo2.m - 程序主文件，直接运行此文件即可!
2、LorenzData.dll - 产生Lorenz离散数据
3、DuffingData.dll - 产生Duffing离散数据
4、RosslerData.dll - 产生Rossler离散数据
5、ccFunction.dll - 计算S(m,N,r,t) - 原C-C方法中计算S(m,N,r,t)，改进的C-C方法中计算S2(m,N,r,t)
6、ccFunction_luzhenbo.dll - 计算S(m,N,r,t) - 改进的C-C方法中计算S1(m,N,r,t)
--------------------------------
致谢：
此稿本次修改的部分灵感来源于与研学论坛网友“张文鸽”和“yangfanboy”的讨论，在此表示感谢!-C-C methodology and improvement of C-C method reconstruction phase space of Matlab procedures-------------------------------- performance : 3000 data time-consuming three minutes------------------------------- References : 1, Nonlinear dynamics, delay times, and embedding windows.pdf 2, Based on the C-C method of phase space reconstruction parameters choice 4.pdf-------------------------------- folders : one, C_C_Method_luzhenbo2.m-main proceedings, direct running this file can be! 2. LorenzData.dll- Lorenz have three discrete data, DuffingData.dll- Duffing have four discrete data, RosslerData.dll- Rossler have discrete data 5, ccFunction.dll-calculated S (m, N, r, t)- the original C-C method to calculate S (m, N, r, t), to improve the C-C method of calculating S2 (m, N, r, t) 6,
Platform: |
Size: 475136 |
Author: jiao |
Hits:
Description: 分享好书(good)：台湾人的著作《Spring 技术手册》等 在网上找到了台湾java专家林信良的著作 《Spring 技术手册》的电子书和大家分享下～～～只是缺了AOP的介绍，不过已经很全面了,台湾技术书籍的特点：通俗易懂，深入浅出，结合实例～～～顺便也带上其它的几本Struts,Hibernate～～
不过，全是繁体字的哦。。。。
另外，《Spring 技术手册》左边的index tree 是乱码！
-share books (good) : Taiwanese book, "Spring Technical Manual" on the Internet to find a java experts Taiwan Lin Hsin-liang's book " Spring Technical Manual, "the e-books and we share ~ ~ ~ just lacking the AOP presentation But very comprehensive, Taiwan technical books features : user-friendly, easy to understand, with examples ~ ~ ~ incidentally also brought several other Struts, Hibernate ~ ~ Nevertheless, the characters are all oh. . . . In addition, "Spring Technical Manual" left index tree is gibberish!
Platform: |
Size: 335872 |
Author: |
Hits:
Description: Wavelets have widely been used in many signal and image processing applications. In this paper, a new
serial-parallel architecture for wavelet-based image compression is introduced. It is based on a 4-tap wavelet
transform, which is realised using some FIFO memory modules implementing a pixel-level pipeline
architecture to compress and decompress images. The real filter calculation over 4 · 4 window blocks is
done using a tree of carry save adders to ensure the high speed processing required for many applications.
The details of implementing both compressor and decompressor sub-systems are given. The primarily analysis
reveals that the proposed architecture, implemented using current VLSI technologies, can process a
video stream in real time.-Wavelets have been widely used in many sign al and image processing applications. In this p aper. a new serial-parallel architecture for wavele t-based image compression is introduced. It is based on a 4-tap wavelet transform. which is realized using some FIFO memory module 's implementing a pixel-level pipeline archite cture to compress and decompress images. The're al filter calculation over 4 blocks window is done using a tree of carry save adders to ensure t he high speed processing required for many appl ications. The details of implementing both com pressor decompressor and sub-systems are give n. The primarily analysis reveals that the prop osed architecture, VLSI implemented using current technologies, can process a video stream in real time.
Platform: |
Size: 2837504 |
Author: sdfafaf |
Hits:
Description: While studying electronic engineering and computer science, I participated in a compiler workshop where we had to write our own programming language. To view and analyse the syntax tree for a given program, I wrote a custom drawn tree component those days. The original component was written in Java and I thought it might be useful to have it as a CTreeCtrl derivate. In contrast to some other custom drawn tree controls at CodeProject, this one does not has its own data structure for representing the tree. This means that you do not have to write different code for inserting the tree items when you want to switch from CTreeCtrl. Because this control inherits from CTreeCtrl, it is very easy to activate the stock-functionality which draws the tree in the traditional way.-While studying an electronic engineering d computer science. I participated in a workshop where we compiler h ad to write our own programming language. To vie w and analyze the syntax tree for a given program , I wrote a custom drawn tree component those da ys. The original component was written in Java an d I thought it might be useful to have it as a CTre eCtrl derivate. In contrast to some other custom drawn tree controls at CodeProject. this one does not has its own data structure for r epresenting the tree. This means that you do not have to write different code for inserting the t ree items when you want to switch from CTreeCtrl . Because this control inherits from CTreeCtrl , it is very easy to activate the stock-functio nality which draws the tree in the traditional w ay.
Platform: |
Size: 18432 |
Author: gaowen |
Hits:
Description: 实现一个B*Tree的添加和查找，输入数据为一组字典文件-achieve a B* Tree Search and the addition, the input data for a group of documents dictionary
Platform: |
Size: 3072 |
Author: Ren Kai |
Hits:
Description: R+树的c实现源码，对应文章T. K. Sellis, N. Roussopoulos, C. Faloutsos: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects.-R tree c achieve source code, corresponding article T. K. Sellis, N. Roussopoulos, C. Faloutsos : The R-Tree : A Dynamic Index for Multi-Dimensional Objects .
Platform: |
Size: 92160 |
Author: 文 |
Hits:
Description: 叉排序树与平衡二叉排序树基本操作的实现
用二叉链表作存储结构
(1)以回车( \n )为输入结束标志,输入数列L,生成二叉排序树T；
(2)对二叉排序树T作中序遍历,输出结果；
(3)计算二叉排序树T的平均查找长度,输出结果；
(4)输入元素x,查找二叉排序树T,若存在含x的结点,则删除该结
点,并作中序遍历(执行操作2)；否则输出信息“无结点x”；
(5)判断二叉排序树T是否为平衡二叉树,输出信息“OK！”/“NO！”；-fork trees and balanced binary tree order to achieve the basic operation of the binary tree used for the storage structure (1), carriage return ( \ n) to mark the end of the importation, importation of L series, generate binary tree Sort T; (2) Ranking of two forks to make the tree T preorder, and the output results; (3) Calculations binary tree T ranking on the average search length, output; (4) Input elements x, find two tree fork Sort T, if x exists with the node, then remove the nodes, and make the preorder (execution 2); Otherwise output "node x"; (5) to determine the order of two trees T fork whether balanced binary tree, and the output message "OK!"/"NO!" ;
Platform: |
Size: 2048 |
Author: 胡图 |
Hits:
Description: 给定一棵树T，树中每个顶点u都有一个权w(u)，权可以是负数。现在要找到树T的一个连通子图使该子图的权之和最大。-given a tree T, tree each vertex u have a right to w (u), the right to be negative. Now to find a tree T connectivity graph so that the graph of the rights and the largest.
Platform: |
Size: 149504 |
Author: wu |
Hits:
Description: CMNCTRL2 Sample: Demonstrates Common Control MFC Classes, Part 2
The CMNCTRL2 sample illustrates how to use the following common control MFC classes: CProgressCtrl, CSliderCtrl, and CSpinButtonCtrl. It shows how the controls are created and how to change the controls using many of the different available styles.
CMNCTRL2 is the result of replacing the original CMNCTRLS sample with two smaller projects: CMNCTRL1 (tree, toolbar, date and time picker, month calendar, and animate controls) and CMNCTRL2 (progress, up/down, and slider controls). This was done to reduce the footprint of the sample code, making it easier to trace specific portions of the application. The list control, originally in the CMNCTRLS sample, can now be found in the LISTHDR sample.
Security Note
This sample code is provided to illustrate a concept and should not be used in applications or Web sites, as it may not illustrate the safest coding practices.
-CMNCTRL2 Sample : Demonstrates Common Control MFC Classes, Part 2 The CMNCTRL2 sample illustrates how to us e the following common control MFC classes : CProgressCtrl, CSliderCtrl. and CSpinButtonCtrl. It shows how the controls are created and how to change the controls using many of the different styles available. CMNCTR L2 is the result of replacing the original CMNCT RLS sample with two smaller projects : CMNCTRL1 (tree, toolbar, date and time picker, month calendar, and animate controls) and CMNCTRL2 (progress. up/down, and slider controls). This was done to reduce th e footprint of the sample code, making it easier to trace specific portions of t he application. The list control, CMNCTRLS originally in the sample. can now be found in the LISTHDR sample. Security Note This sample cod
Platform: |
Size: 26624 |
Author: lorime |
Hits:
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:
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:
Description: B+树算法,没有密码,供学习使用.质量高-B+ Tree algorithm, there is no password, for learning to use. High-quality
Platform: |
Size: 16384 |
Author: cqu2000 |
Hits:
Description: 这是一个表示数据结构tree的c++模板对象,封装的非常好.tree-msvc.hh能在 visual c++下使用,如同使用stl标准模板类库一样-This is a tree data structure that the c++ template object, the package is very good. Tree-msvc.hh be able to use visual c++, as the use of standard template library stl the same as
Platform: |
Size: 197632 |
Author: gzj |
Hits: