搜索资源列表
java_tree
- java swing树形控件的使用,点击控件的节点,在文本域显示所选中节点的名称-java swing tree controls the use, click on the control node selected in the text field to display the name of the node
WorkFlowDemo
- 纯java实现的工作流程编辑器,支持使用拖曳节点定义流程,支持对齐、多选拖放、undo/redo等功能,可以自动按树型排列节点。-Pure java implementation of the workflow editor, support for drag and drop node defines processes to support the alignment, multiple choice and drop, undo/redo functions, can automatica
Dome
- 1.采用链式结构实现任意多项式的存储,求两个多项式的和。 2.假设自上而下按层次,自左至右输入每个结点的一个三元组(D, P, L/R)。其中D为本结点的元素,P为其父结点,L指示D为P 的左孩子,R指示D为P的右孩子。试写一个建立二叉树在内存的双链表示算法,并实现先根、中根、后根以及层序遍历算法。 3.采用邻接矩阵实现有向网的存储,建立有向网,并实现单源最短路径算法。-1 using an arbitrary polynomial chain structure of storag
vs2008-CPP-Package
- 实现树控件,并判断节点是否被点击,并把点击的内容显示在右边新建的视图窗口里-Realize the tree control, and to determine whether a node by clicking, and click on the content of the show in the new view window on the right
Desktopf
- 从输入的二叉排序树中删除一个结点。通过考虑该节点分别是叶节点,或只有左子树或右子树,或左右子树全不为空的状况-From the input binary sort tree to remove a node. By considering the node is a leaf node, respectively, or only a left subtree or right subtree, or left and right subtrees whole situation is not
huffman
- Huffman编码的关键点是构造一棵Huffman树。其过程是: 1.输入各个叶子节点及其频率,对每个节点的lchild, rchild, parent分别赋初值为0; 2.选择parent为0,且fre最小的两个节点开始建Huffman树,再修改相应节点的lchild, rchild, parent值,如此重复直到Huffman树建立。 3.从叶子到根逆向求每个节点的Huffman编码。 4.解压时,由于Huffman编码是前缀编码,即任一字符的编码都不是
BiTree
- 二叉树的实现,根据输入序列自动生成一颗二叉树,可以对生成的二叉树进行遍历和增删节点!-Binary tree implementation, based on the input sequence automatically generates a binary tree, you can generate a binary tree traversal and deletions node!
Implementing-BSTs
- An important special kind of binary tree is the binary search tree (BST). In a BST, each node stores some information including a unique key value and perhaps some associated data. A binary tree is a BST iff, for every node n, in the tree: All k
Huffman
- 哈弗曼编码,构造哈夫曼树,构造哈夫曼树非常简单,将所有的节点放到一个队列中,用一个节点替换两个频率最低的节点,新节点的频率就是这两个节点的频率之和。这样,新节点就是两个被替换节点的父节点了。如此循环,直到队列中只剩一个节点(树根)。-Hoffman coding, Huffman tree structure, Huffman tree structure is very simple, all the nodes in a queue, replace the two lowest frequ
TreeControlDemo
- 动态添加、删除树形控件的节点,获取树形控件的选中项-Dynamic node add, delete tree controls, select the item for tree control
Spanning-through-the-url-for-html
- 通过URL对网页进行网页分析并将网页的节点生成树结构-Through the URL for web analytics and web pages node tree structure
nodeparentnodenull
- The "getParentNode()" method invoked on a node that has just been created and not yet added to the tree is null.
dtreeTopdf
- 一个树形菜单,实现:用javascr ipt代码动态构建目录树,而不需要任何配置文件。 在安装pdf阅读器的条件下,可以浏览pdf文件。并且实现指定页打开。树形菜单添加复选框,实现勾选父节点的复选框,自动全选其子节点。实现批量打开pdf。-A tree menu: to build a directory tree using javascr ipt code dynamically, without the need for any configuration files. Under t
TaskDistribution
- 算法设计与分析中的任务分配问题。 用回溯法解该问题时,用完全n叉树表示解空间。可行性条件select 剪去不满足行、列约束的子树。递归方法 backtrack(1)实现对整个解空间的回溯搜索;backtrack(i)搜索解空间中的第i层子树,sum记录当前已找到的可行方案 数。在算法backtrack中,当i>n时,算法搜索至叶子结点,当前已找到的可行方案数sum加1;当i<=n时,当前扩展结点 Z是解空间中的内部结点。该结点有x[i]=1,2,...,n共n个
M
- 字典树的基本功能是用来查询某个单词(前缀)在所有单词中出现次数的一种数据结构,它的插入和查询复杂度都为O(len),Len为单词(前缀)长度,但是它的空间复杂度却非常高,如果字符集是26个字母,那每个节点的度就有26个,典型的以空间换时间结构。-The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the
TreeControlDemo
- 动态添加、删除树形控件的节点,获取树形控件的选中项,VC++精选编程学习源码,有助于学习进步。-Dynamic node add, delete tree controls, obtain the tree controls the selected item, VC++ select learning programming source code, contribute to the learning progress.
BitmapTreeDemo
- 在树形控件中使用背景位图,VC++精选编程学习源码,有助于学习进步。-Dynamic node add, delete tree controls, obtain the tree controls the selected item, VC++ select learning programming source code, contribute to the learning progress.
prim
- prim算法输出一个最小生成树,prim算法最先是找到一个根节点,然后在继续生成最小生成树,这样就能找到一个最小生成树,如果是这样的话,我们可以用一个循环,把每一个节点当作根节点,再把重复的树删除,这样就能找到所有的最小生成树了-algorithm prim, prim algorithm was first to find a root node, and then continue to generate the minimum spanning tree, so that we can f
Binary_Tree
- 二叉树是每个节点最多有两个子树的有序树。通常子树被称作“左子树”(left subtree)和“右子树”(right subtree)。二叉树常被用于实现二叉查找树和二叉堆。值得注意的是,二叉树不是树的特殊情形。在图论中,二叉树是一个连通的无环图,并且每一个顶点的度不大于3。-Each node in a binary tree is an ordered tree up to two sub-tree. Usually sub-tree is called " left sub-tre
redblacktree
- 随机生成一颗1000个节点并插入一颗红黑树,然后返回树的高度和根节点值-Randomly generated a 1000 node and insert a red-black tree, and then return the value of the tree height and root