Search - Tree control

Search - Tree control - List

[Data structs] AlgorithmCode DL : 0: 海明码出站入站序列非递归生成树九格填质数七子控棋盘等等算法-Haiming yards out station stops recursive sequence-9 grid spanning tree fill several seven-quality control algorithm chessboard, etc.
Date : 2025-12-17 Size : 5kb User : 张广旭
[Data structs] HuffmanCode DL : 0: 数据结构课程Huffman编码实验课程作业，具有完整控制台界面，实现功能1.由字符串生成huffman码2.打印huffman树3.由huffman码还原为字符串-Data structure course experiment coursework Huffman coding, with a complete control panel interface, the realization of function 1. Huffman code generated by the string 2. Huffman tree print 3. Huffman code to restore from a string
Date : 2025-12-17 Size : 3kb User : che
[Data structs] 12 DL : 0: 掌握堆的定义、存储结构及原理 2、掌握堆的运算 3、掌握哈夫曼树的定义 4、掌握构造哈夫曼树的方法 -Grasp the definition of the heap, storage structure and principle of two, master of the heap operations 3, 4 to grasp the definition of Huffman, Huffman tree construction methods of control
Date : 2025-12-17 Size : 446kb User : chen
[Data structs] test_tree DL : 0: 四级树结构的显示,数据库中的编码列分四级,本程序从数据库中读取数据,并显示在树型控件上-Four tree display, database, four points in the code column, the program reads data from the database and displayed in the tree control
Date : 2025-12-17 Size : 9kb User : wwch
[Data structs] fenzhijiexianfa DL : 0: 分支界限法是由“分支”和“界限”策略两个部分组成，其中“分支”策略是对问题空间按照广度优先的策略进行搜索；“限界”策略是为了加速搜索速度而采用启发信息剪枝的策略。使用分支限界法来解决单源最短路径问题时主要利用结点控制关系剪枝，在一般情况下，如果解空间树中以结点Y为根的子树中所含的解优于以结点X为根的子树中所含的解，则结点Y控制了结点X，以被控制的结点X为根的子树可以剪去。算法实现时，使用邻接矩阵表示图，二维数组存储图的邻接矩阵，使用数组记录源到各顶点的距离和路径上的前驱顶点。 -Branch and bound by the "branch" and "boundaries" strategy of two parts, one "branch" strategy is the problem of space in accordance with the breadth-first search strategy "bound" strategy is to accelerate the search speed and the use of heuristic pruning strategy. Using the branch and bound method to solve the single-source shortest path problem between the main control by pruning nodes, in general, if the solution space to the tree root node Y is contained in the solution sub-tree nodes than to X is the root of the solution contained in the subtree, then Y control the end point node X, to be controlled node X is the root of the sub-tree can be cut. Algorithm, the use of adjacency matrix graph, two-dimensional array stored in the adjacency matrix, using an array of records from the source to the vertex distance and path of the precursor peak.
Date : 2025-12-17 Size : 1kb User : ss
[Data structs] heapsort DL : 0: 堆排序树控件显示效果，用MFC实现。输入一串字符在nlog2n时间之类排序-Heap sort tree control display
Date : 2025-12-17 Size : 23.59mb User : 李俊
[Data structs] heapsort DL : 0: 堆排序树控件显示效果，用MFC实现。输入一串字符在nlog2n时间之类排序-Heap sort tree control display
Date : 2025-12-17 Size : 22.26mb User : 李俊
[Data structs] heap DL : 0: 使用MFC可视化界面，实现数据结构中的对排序，初始堆和排序后的堆都用树控件显示-Visual interface using MFC, data structure of the sort, after the initial heap and sort heap is a tree control displays
Date : 2025-12-17 Size : 26kb User : wangyun
[Data structs] test10 DL : 0: （1）掌握图的邻接矩阵、邻接表、十字链表等不同存储形式的表示方法。（2）掌握图的两种不同遍历方法的基本思想并能编程实现。（3）掌握构造最小生成树的两种算法，即Prim 算法和Kruscal算法的思想，并能编程实现。（4）能够灵活运用图的相关算法解决相应的实际问题。 -(1) master the adjacency matrix, adjacency list, cross-linked forms of representation of different storage methods. (2) two different master plans through the basic idea and can be programmed. (3) control construct two algorithms for minimum spanning tree, that Prim algorithm and Kruscal algorithm ideas, and to programming. (4) flexibility to use the corresponding graph-related algorithms to solve practical problems.
Date : 2025-12-17 Size : 1kb User : yuan li
[Data structs] cds DL : 0: 虚拟骨干网，包括佛罗里达大西洋大学的Jie Wu和Hailan Li 提出的关于连通控制集的算法，第二种算法是das等提出的从找到最小近似控制集到建立一个最小生成树的算法，最后一种算法是通过寻找MIS集获得CDS的方法。这三种算法提供了三种建立CDS集的方法，连通控制集（connected dominating set，CDS）作为层次路由协议中的虚拟主干是网络中保证其余节点能顺利通信的关键，它们承受更高的通信和计算负荷，网络的可靠性会因这些关键节点中的某个节点的失效而受影响。-Virtual backbone, including Jie Wu, Florida Atlantic University and Hailan Li on the connected dominating set algorithm, the second algorithm is das, etc. proposed the establishment of a minimum spanning tree algorithm to find the smallest approximate control set to the last onethe algorithm is obtained by finding the MIS set of CDS. Of the three algorithms, three kinds of CDS set, connected dominating sets (connected dominating the set, CDS), as a hierarchical routing protocol in the virtual backbone is the network to ensure that the remaining nodes can successfully communicate key, they are subjected to higher communication and the computational load, the reliability of the network due to the failure of these critical nodes in a node affected.
Date : 2025-12-17 Size : 3.29mb User :
[Data structs] MyB_Tree DL : 0: 用了树形控件的数据结构，还有一些很重要的算法-This is a family tree, using a tree data structure of control
Date : 2025-12-17 Size : 1.11mb User : timapzeng
[Data structs] 312010 DL : 0: 1．掌握二叉树的基本概念和性质 2．掌握创建和构造二叉链表的算法 3．掌握二叉树链表存储基础的的三种递归遍历算法和非递归算法。 4．掌握计算二叉树的结点、二叉树的深度和二叉树的叶子结点数等算法。 5．掌握huffman树的构造和编码。实验要求：（1）理解二叉链表的初始化、二叉树空的判断；（2）理解二叉树的遍历算法，掌握其应用。 -A. Grasp the basic concepts and properties of the binary tree. Master to create and construct a binary linked list algorithm. Master binary tree linked list is stored based on the three recursive traversal algorithm and non-recursive algorithm. 4. To master computing node of the binary tree algorithm of depth of the binary tree and binary tree leaf nodes. 5 Master the structure and encoding of the huffman tree. Experiments: (1) to understand the judgment of the initialization of the binary linked list, binary tree empty (2) understand the binary tree traversal algorithm, and control over their applications.
Date : 2025-12-17 Size : 20kb User : 刘国佳
[Data structs] ObjectListViewFull-2.5.1 DL : 0: 这是一个带有树状结构的DataGrid控件-This is a DataGrid control with a tree
Date : 2025-12-17 Size : 1.14mb User : anjie
[Data structs] DragDropApp DL : 0: 树节点菜单的C#实例源码下载，在节点处应用于图像技术，参考价值大，C#制作的树控菜单源码实例，新手朋友，可不要错过哦。-Tree node menu C# example source code download at the nodes used in image technology, large reference value, the tree control menu source C# produced instance, novice friends, can not miss.
Date : 2025-12-17 Size : 25kb User : fwtca1