Welcome![Sign In][Sign Up]
Location:
Search - x tree

Search list

[Other resourcextree.tar

Description: X-tree的C++源码,对应文章S. Berchtold, D. A. Keim, H.-P. Kriegel: The X-tree : An Index Structure for High-Dimensional Data. -X-tree in C source code, the corresponding articles S. Berchtold, D. A. Keim. H.-P. Kriegel : The X-tree : An Index Structure for High-Dimensional Data.
Platform: | Size: 30567 | Author: | Hits:

[J2MEC-XMLCode

Description: 解析xml为树状结构,c编写-analytic xml structure of the tree, c prepared
Platform: | Size: 29696 | Author: 王琴 | Hits:

[GPS developlabeltool-1

Description: abel Tool Sample Requires: Visual Basic 6 and MapObjects 2.x Data: redlands.shp (Redlands sample data set from MO 2.x) Interactive Labeling Tool If the check box is checked, then the mouse down location will search for the closest line, and label it with the street name. If the check box is not checked, then the mouse down will turn into a pan/zoom tool. There is a slider bar to control the search tolerance in screen pixels for the labeling. -abel Tool Sample Requires: Visual Basic 6 and MapObjects 2.x Data: redlands.shp (Redlands sample data set from MO 2.x) Interactive Labeling Tool If the check box is checked, then the mouse down location will search for the closest line, and label it with the street name. If the check box is not checked, then the mouse down will turn into a pan/zoom tool. There is a slider bar to control the search tolerance in screen pixels for the labeling.
Platform: | Size: 189440 | Author: tnth2so4 | Hits:

[Data structsxtree.tar

Description: X-tree的C++源码,对应文章S. Berchtold, D. A. Keim, H.-P. Kriegel: The X-tree : An Index Structure for High-Dimensional Data. -X-tree in C source code, the corresponding articles S. Berchtold, D. A. Keim. H.-P. Kriegel : The X-tree : An Index Structure for High-Dimensional Data.
Platform: | Size: 30720 | Author: | Hits:

[Software Engineeringshujujiegou-erchashu

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:

[OtherE64_0230

Description: 平衡二叉树操作的演示 一、 需求分析 (1) 利用平衡二叉树实现动态查找表。实现查找,插入和删除三种基本功能。 (2) 初始,平衡二叉树为空树,操作界面给出查找,插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时,显示更新的平衡二叉树。 (3) 重点在于对删除算法的实现。假设要删除的关键字为X的结点,若X不在叶子结点上,则用左子树中的最大值或者右子树中的最小值取代X。如此反复,直到删除动作传递到某个叶子结点,删除叶子结点时,若要进行平衡变换,可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Insert the available balance transform inverse transform.
Platform: | Size: 40960 | Author: 苏言暖 | Hits:

[JSP/JavaJTree

Description: 一个很好的jTree的例子,把JTree嵌在了网页上面,通过XML读取树的节点-JTree a good example of the JTree embedded in the page above, read through the XML tree node
Platform: | Size: 18432 | Author: yue | Hits:

[OtherTreeplan

Description: Excel下的决策树宏文件!启用宏并加载就好了!很好用噢!-Excel macro file under the tree! Enable Macros and load it! Oh well spent!
Platform: | Size: 82944 | Author: 藤原佑翼 | Hits:

[JSP/Javajstree

Description: javascript+xml树带ur功能 很好用的-javascript+ xml tree with a good used ur function
Platform: | Size: 14336 | Author: wnagge | Hits:

[matlabprim_kruskal_matlab6.5

Description: prim算法 kruskal算法用matlab实现 输入标准:x邻接矩阵 p节点集 输出:生成树边集 G-prim algorithm Kruskal algorithm matlab input standard: x adjacency matrix p Node Set Output: Spanning Tree margination G
Platform: | Size: 1024 | Author: yumeng | Hits:

[Mathimatics-Numerical algorithmsdivi

Description: 正整数x 的约数是能整除x 的正整数。正整数x 的约数个数记为div(x)。例如,1,2,5,10 都是正整数10 的约数,且div(10)=4。设a 和b 是2 个正整数,a≤b,找出a 和b之间约数个数最多的数x。 对于给定的2 个正整数a≤b,编程计算a 和b 之间约数个数最多的数。 数据输入 输入数据由文件名为input.txt的文本文件提供。文件的第1 行有2 个正整数a和b。 结果输出 程序运行结束时,若找到的a 和b 之间约数个数最多的数是x,将div(x)输出到文件output.txt中。 输入文件示例 输出文件示例 input.txt output.txt 1 36 9 -Positive integer x can be about a few of the positive integer x divisible. Positive integer x the approximate number recorded as the number of div (x). For example, 1,2,5,10 are about 10 positive integer number, and div (10) = 4. Set a and b are two positive integers, a ≤ b, to find a and b between about a few number of the largest number of x. For a given two positive integers a ≤ b, Programming calculated a and b between about a few number of the largest number. Data entry input data from the document text file named input.txt provide. File line 1 has two positive integers a and b. The results run the end of the output, if found between a and b of about a few number of the largest number are x, the div (x) of output to a file output.txt. Sample input file output file example input.txt output.txt 1 36 9
Platform: | Size: 1024 | Author: 林雨 | Hits:

[GUI Developgridctrl_demo220

Description: Using comboboxes in the MFC Grid Control Since I posted my MFC grid control I ve had a lot of requests asking how to use other methods of editing cells in the grid. Ken Bertelson has taken this to the extreme, with his Grid Tree control. For some this was a little too involved, so I ve created a demo project that shows how to replace the default editing with a simple combo box. Previous methods of achieving this required that a new CGridCtrl derived class be created. With the new structure in the 2.X versions of CGridCtrl it s now a lot simpler. -Using comboboxes in the MFC Grid ControlSince I posted my MFC grid control I ve had a lot of requests asking how to use other methods of editing cells in the grid. Ken Bertelson has taken this to the extreme, with his Grid Tree control. For some this was a little too involved, so I ve created a demo project that shows how to replace the default editing with a simple combo box. Previous methods of achieving this required that a new CGridCtrl derived class be created. With the new structure in the 2 . X versions of CGridCtrl it s now a lot simpler.
Platform: | Size: 206848 | Author: mark | Hits:

[Windows DevelopX-tree

Description: Document for X-tree algorithms
Platform: | Size: 1159168 | Author: liuzhiyong | Hits:

[JSP/JavaJsTree

Description: 网上收集的多个javascript树形结构的代码,其中部分带checkbox的树形结构,非常值得学习-javascript tree menu checkbox
Platform: | Size: 191488 | Author: allen | Hits:

[JSP/JavaTreePanel-test.0.3r

Description: 带checkbox树形控件 <javascript>-Tree controls with checkbox
Platform: | Size: 57344 | Author: Levin | Hits:

[Data structsbottom-up.tar

Description: 用java 实现的X-tree,希望大家喜欢-X-tree implemented in java, hhe
Platform: | Size: 62464 | Author: wang pu | Hits:

[Data structsTree

Description: 1.16② 试写一算法,如果三个整数X,Y和Z 的值不是依次非递增的,则通过交换,令其为 非递增。 -Status Dencendant(Array1D L,Array1D R,int n,int u,int v) /* If node u is the dencendant of node v ,*/ /* then return TRUE else return FALSE . */ /* L[i] is the left child of the i_th node, */ /* R[i] is the right child of the i_th node */ /* in the Binary Tree which has n nodes. */
Platform: | Size: 1024 | Author: garming | Hits:

[OtherQt-Whitepaper(CN)

Description: 此白皮书介绍了 Qt C++ 框架。Qt 采用“一写永逸”的方法支持开发跨平台的 GUI应用程序。使用单一源码树和简单的重编译式,可以为 Windows 98 至 WindowsXP、Mac OS X、Linux、Solaris、HP-UX 以及其他使用 X11 的 Unix 版本编写各种序。此外,还可以编译在嵌入式 Linux 平台中运行的 Qt 应用程序。Qt 引入了一种名为“信号和槽”的独特对象间通信机制。Qt 还为 2D 和 3D 图形、国际化、SQL、XML、单元测试提供了卓越的跨平台支持,并为特定应用程序提供了针对具体平台的扩展。您可以使QtDesigner(Qt 设计者)(一种支持 IDE 集成的灵活用户界面构建器)构建器来可视化的建立 Qt 应用程序。 -This white paper describes the Qt C++ framework. Qt uses "Wing Yi will write" approach to support cross-platform GUI development Application. Using a single source tree and a simple recompile, it can be for the Windows 98 to Windows XP, Mac OS X, Linux, Solaris, HP-UX and other Unix version uses X11 s written procedures. This , But also can compile in the embedded Linux platform running Qt application. Qt introduced called "signals and Trough, "the unique communication mechanism between objects. Qt 2D and 3D graphics also, international, SQL, XML, unit testing provides Excellent cross-platform support, and provide for a specific application, platform-specific extensions. You can use the Qt Designer (Qt designer) (a kind of IDE integration support for flexible user interface builder) to the visual builder Build Qt applications.
Platform: | Size: 1300480 | Author: liliyang | Hits:

[Windows DevelopTree-C-Evaluate

Description: With C tree design paranthesis notation and x notation and evaluate tr-With C tree design paranthesis notation and x notation and evaluate tree
Platform: | Size: 44032 | Author: Bulut | Hits:

[Industry researchThe-X-tree--

Description: 一个对高维数据的索引结构 此为研究树形结构的国外文献 以供各位参考-One for reference for the study of foreign literature of the tree structure of the index structure of high dimensional data
Platform: | Size: 98304 | Author: 小龙 | Hits:
« 12 3 4 5 6 »

CodeBus www.codebus.net