Search - Tree - CodeBus

Search - Tree - List

[Other] treestore DL : 0: 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().
Date : 2008-10-13 Size : 41.06kb User : 陈伟
[Other] 赫夫曼树和编码 DL : 0: 最优二叉树及编码，能够实现给出一组频率构造最优二叉树且求出其编码，在通讯中具有很好的作用。-optimal binary tree and coding, to achieve a given frequency Construction Group optimal binary tree can get its coding, the newsletter has a very good role.
Date : 2008-10-13 Size : 1.34kb User : 廖高
[Other] 四分树的穷举 DL : 0: 使用VC为编程语言，结合数据结构二叉树的概念，新编算法进行四分树的穷举。-VC to use programming language, combine the binary tree data structure concept, a new edition of the tree algorithm quarter of exhaustive.
Date : 2008-10-13 Size : 4.8kb User : 苏晓
[Other] Kruskal.cpp DL : 0: 在权值不同的图中寻找一个最小生成树的问题-different weights in the map to find a minimum spanning tree problem
Date : 2008-10-13 Size : 2.97kb User : 刘通学
[Other] BottomUpParser DL : 1: （1）可选择不同的规则集（用普通文本文件存贮规则）。（2）利用VC TreeCtrl控件显示分析得到的句法结构树。（3）中间分析过程产生的所有边都输出到结果文件，便于跟踪分析的细节。（4）分析过程中，检索规则集中的规则，查到一条满足条件的规则就停止，因而产生的不是全部分析结果，并且，规则的顺序也会对分析结果有影响（可比较两个规则文件，其中规则内容一样，但有两条规则的顺序不同，在分析 “学习/verb 文件/noun” 这样的例子时结果就不同： -(1) choice of different sets of rules (using ordinary text file storage rules). (2) VC TreeCtrl control analysis showed the syntactic structure of the tree. (3) Intermediate analysis of all the edges are exported to the outcome document, and facilitate the tracking analysis of the details. (4) analysis process, the rules focus on the search rules, found a meet conditions to stop the rules, which not all of the analysis results, and, rules of the order will also have an impact on results of the analysis (which can compare the two rules, which rules the same content, but there are two the sequence of the different rules, the analysis of "learning / verb documents / noun" Such examples on the different results :
Date : 2008-10-13 Size : 52.97kb User : 丁淑彬
[Other] PcfgParser DL : 0: 1. 先打开规则库，读入规则集（可比较两个规则文件rule1.txt 和 rule2.txt的差异） 2. 选择经过分词和词性标注的文件，进行句法分析 3. 分析结果文件与测试文件在同一个目录下，文件后缀名为 .pcfg 4. 分析结束后，同时产生一个新的规则文件,后缀名为.new, 可以观察规则概率值和期望次数的变化 5. 分析结果逐个以树形图方式显示，如果一个句子有多个结果，在显示框中同时显示。-1. Accounting rules to open, read the rules set (comparable two documents rule1.txt rules and the differences rule2.txt) 2. Word selection and tagging of a document for syntactic analysis 3. Results of the analysis and test document with a document in the directory, documents suffixes called. pcfg 4. After the analysis, while generating a new rule, known as the suffix. new, can observe the rules of probability values and expectations of changes in the number of five. results of the analysis-by-tree approach to show that if a sentence is over, the box shows the same time show.
Date : 2008-10-13 Size : 52.01kb User : 丁淑彬
[Other] zhou_tree DL : 0: 汇编程序，输入一组数字，生成二叉树，再进行前序，中序，后序三种遍历。含错误检测。-assembler, the importation of a group of figures, generating a binary tree, and before ordering, which sequence, after three traversal sequence. With error detection.
Date : 2008-10-13 Size : 6.11kb User : 周伟斌
[Other] Delphi精选 DL : 0: 基于Delphi的，用于前台产生BOM树状结构的递归过程-based Delphi, prospects for the tree structure generated BOM recursive process
Date : 2008-10-13 Size : 18.56kb User : 阿飞
[Other] 南京市部分公交转车系统 DL : 0: a)需求分析：任务：建立南京主要公交线路图。要求：输入任意两地点，给出最佳的乘车线路和转车地点。 b)概要设计：本程序所使用的数据结构是树和线性表，所使用的算法主要有堆排序、赫夫曼算法。 -a) Requirements Analysis : Mandate : the establishment of the Nanjing main transit route map. Requirements : 2 importation arbitrary locations, is the best car lines and interchange locations. B) Summary of design : the procedures used by the data structure is linear tree and table, the algorithm used by the main sculpture, in order Huffman algorithm.
Date : 2008-10-13 Size : 2.62kb User : 李韦纬
[Other] 统计英文文章的字符个数并huffman编码 DL : 0: a)需求分析：任务：对一篇英文文章，统计各字符出现的次数，实现Huffman编码；要求：输出每个字符出现的次数和编码，其中求最小权值要求用堆实现； b)概要设计：本程序所使用的数据结构是树和线性表，所使用的算法主要有堆排序、赫夫曼算法。 -a) Requirements Analysis : Mandate : an article in English, statistics of the number of characters to achieve Huffman coding; Requirements : Every character in the output of the number and the code for which the minimum requirement of the right to use Heap; B) Summary of design : the procedures used by the data nodes the tree structure and linear form, the algorithm used by the main sculpture, in order Huffman algorithm.
Date : 2008-10-13 Size : 2.77kb User : 李韦纬
[Other] 图书馆V2 DL : 0: 一个采用B-树数据结构制作的图书馆管理程序，功能较简单，适合大学生数据结构参考使用-use a B-tree data structures produced by the library management procedures and functions than simple data structure suitable for college students to use reference
Date : 2008-10-13 Size : 6.3kb User : 吴晓辉
[Other] 200561674082801 DL : 0: 我最近的作业，是二叉树的基本操作，新手，各位多多关照。-my recent operations, a binary tree is the basic operation, and newcomers, to take care of you.
Date : 2008-10-13 Size : 2.5kb User : chuanxin
[Other] 求二叉树的高度、叶子节点数 DL : 0: 求二叉树的高度和深度，求高度时采用递归算法，求深度时采用非递归算法。-for binary tree height and depth, used for highly recursive algorithm, seeking depth of the use of non - recursive algorithm.
Date : 2008-10-13 Size : 8.95kb User : 乐天
[Other] mclolor DL : 0: 用VC写的一个小程序，用数组代替解空间树，可以实现图用m种颜色着色的问题。-VC write a small program used to solve the spatial array to replace the tree, can achieve a map m colors coloring problems.
Date : 2008-10-13 Size : 13.09kb User : 蔡淑佳
[Other] c 语言开发b-tree数据文件索引 DL : 0: c 语言开发b-tree数据文件索引 .zip -b-tree data files Index c language b-tree index data files. Z IPS language b-tree index data files. zipc language b-tree data files Index . zip
Date : 2008-10-13 Size : 15.53kb User : 唐颖
[Other] tree-ron DL : 0: 输入数据，同时实现二叉排序树的生成，根据此树实现各种算法-input data, while achieving binary tree sort of generation, under the tree of various algorithms
Date : 2008-10-13 Size : 33.02kb User : 李海
[Other] prime-tree DL : 0: 最小生成树：利用普鲁姆算法，完成将给定节点和边的权值的图生成最小生成树，用于各项公共事业最少经费的设计方法-minimum spanning tree : pass algorithm, Givens completed nodes and the right side of the value of the minimum spanning tree generation for public utilities at least for the design method
Date : 2008-10-13 Size : 1.62kb User : 杨翠
[Other] Tree+Postorder DL : 0: 层次输入建立二叉树并后序遍历,三叉链式存储,递归遍历-import levels and the establishment of a binary tree after preorder, trigeminal chain store, recursive traversal
Date : 2008-10-13 Size : 1.43kb User : xsfh9
[Other] Kd-tree DL : 0: KD 树代码，常见的数据搜索算法，比较实用-KD tree code, common data search algorithms, more practical
Date : 2008-10-13 Size : 4.42kb User : nanyuan
[Other] huffman tree DL : 0: huffman tree 问题描述：设一份电文中有不同出现频率的字符，为了提高电文的输入和翻译效率，必须有一套简短而又不会产生歧义的字符代码。试根据哈夫曼算法，对电文中的不同字符，构造出一棵哈夫曼树，对每个字符进行编码。-Huffman tree Problem description : Let a message different frequency of the characters, in order to enhance the input and message translation efficiency, we must have a brief but no ambiguity of the characters code. Examination under Huffman algorithm, the message of characters, construct a Huffman tree for each character coding.
Date : 2008-10-13 Size : 9.64kb User : 李明

« 12 3 4 5 6 »