搜索资源列表
kdtree
- 在图像处理中，用最优节点优先法，建造kd树，用于特征点匹配-In the image processing, the optimal node with priority method, build kd tree, used for matching feature points
zigbee-experimental-instruction
- FS_zigbee协议栈实验指导书，包括采集节点和传感节点的通信分析，开关节点和控制节点的通信分析，树状网络的通信分析，硬件电路和驱动分析-FS zigbee protocol stack experimental instruction, including collection node and a sensor node analysis of communication, switch node and control node of the communication analysis
MFCTree
- MFC树型控件的操作过程，包括在MFC对话框中使用程序的方法添加树型控制的详细过程。此程序使用VS2010开发，界面中可以添加树形节点，修改并删除树型控件中的节点项。-MFC tree control operation, including the procedures used in the MFC dialog box to add the tree control process. This program uses the VS2010 development, can add a t
Balanced-binary-tree
- 主要包括二叉树的建立和删除以及二叉树的一些基本操作：增加节点、删除节点和查找节点。-Balanced binary tree
treeview2xml
- 将树的节点保存到XML文件中，在程序加载时由重XML文件中读取出来，达到Tree和XML的相互转化。-The Tree node saved to the XML documents, in the program when loading by heavy XML documents read out to the Tree and XML conversion.
tree
- 二叉树是每个节点最多有两个子树的有序树二叉树是每个节点最多有两个子树的有序树-A binary tree is most each node has two clauses of the orderly tree treeA binary tree is most each node has two clauses of the orderly tree tree
JTreeDemo
- 用java实现树状图的展示，显示根节点，子节点，实现节点的伸缩-Use Java realize the tree s show, show the root node, child nodes, and realize the node of the expansion
Node
- 非常实用的系统架构模式，以树结构构建系统架构，即插即用的模式，能够实现复杂对象系统，来自于项目的实例，极具参考价值。包括对父子节点的操作。-Very practical system architecture model, a tree structure to build the system architecture, plug and play mode, complex objects, in the instance of the project, great reference va
erchashu
- 二叉树的基本操作，包括创建，遍历，求深度，各节点的交换子树，递归及非递归算法遍历。-The basic operation of the binary tree, including creating, traverse, for depth, each node of the exchange son tree, a recursive and the recursion algorithm to traverse.
cRegistryBrowser
- C#浏览注册表内容的实例源代码，我觉得是个不错的注册表操作实例程序，通过本实例您可以掌握使用C#语言如何读取注册表的节点和键值，如何以树控菜单的形式展现注册表中的数据，程序虽然小，但应用到的适应非常实用，C#注册表操作源码下载分享给大家。-C# source code examples visit the registry s content, I think is a good registry operations are examples of procedures in this ins
BrowReg
- 读取注册表的节点和键值，以树控菜单的形式展现注册表中的数据。 -Nodes and keys to read the registry to show the data in the registry, the form of a tree control menu.
bst
- 一个二叉树的建立，删除 ，遍历，增加节点，删除节点，查找节点，树的高度-A binary tree traversal, increase, delete, delete nodes, node, the node search, the height of the tree...
VCPPtreekjsrc
- VC++从树控件中删除项目，删除节点或删除节点中的项目，一个树形菜单的应用源码，树控菜单应用广泛 ，在窗体中十分常见。-VC++ deleting items from tree control, delete node or delete the node project, a tree menu application code, the tree control menu applications, in the form are very common.
erchashu-
- C语言实现二叉树的创建 及先序、后序、层序遍历，输出树的深度，每一层节点个数，叶子总数-Creation and the first sequence of binary tree in C language, the order of the sequence traversal, output the depth of the tree, each layer the number of nodes, leaves the total number of
huffmantree-code
- 此代码为哈弗曼编码，主要功能是输入结点数以及权值，构造出哈夫曼树，并且把构造结果输出到屏幕，结果会显示哈夫曼树的左孩子和右孩子以及双亲节点等-The code is Felicity Huffman coding, the main function is to enter a nodal points and weights, construct a Huffman tree, and the result is output to the screen structure, results
Btree
- 可以通过按键演示二叉树的创建、查找节点、删除节点、演示树高等-Through the creation of the key demo binary tree to find nodes, delete nodes, presentation tree higher
Smlant_TreeView
- 树的生成与树的动态样式：根据不同的节点选择不同的模板进行添加-Tree generates dynamic style
base1
- vc开发的二叉树实现程序，创建二叉树时，采用先序（node-left-right）的方式，每输入一个结点值（字符），敲一下回车键，再输入下一个节点值，空结点值用 * 表示，每个叶子节点必须后跟两个空指针，并输出了它的中序遍历形式和绘图的形式，有助于初学者加深对二叉树概念的理解-Vc development of binary tree realize the program, creating a binary tree, the first order (node-left-right) wa
tree
- 二叉树的基本运算，遍历，从根节点到子节点的路径和中序线索化。还有用遍历构造二叉树和用二叉树来表示代数表达式。-The basic operations of binary tree traversal path from the root node to child node in the sequence threaded. There traverse the constructed binary tree and binary tree to represent algebraic exp
output-a-tree
- 树的水平输出算法实现：对于给定二叉树，以水平方向输出二叉树。每个节点包含一个整数值，并且节点数最大255。节点数据的输出方向为从左到右，从上到下，同一水平高度的节点输出完成后，再输出下一水平高度。 -The tree level output algorithm: output in the horizontal direction for a given binary tree, binary tree. Each node contains an integer value, and t