搜索资源列表
实验7 二叉树 北京师范大学数学科学院
- 自创的算法，输入表达式，建立二叉树的程序，然后输出前缀中缀后缀表示法，利用的对表达式的分割与递归实现输入，同时这也是一个完整的波兰式转换程序，相当稳健-own algorithm, the importation of expression, the establishment of the binary tree and then output the suffix prefix which is made up of the met
suffixtree
- 中科院计算所的关于后缀树的一个ppt,内容是英文的-calculation of the Chinese Academy of Sciences on a suffix tree ppt, as is the English
消除左递归得到后缀式
- 解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original grammar, after equal in value grammar establishment grammar tree which eliminates the left recursion, aft
main
- 后缀树构造软件
libsfxdisk-1[1].2.tar
- 后缀数存储算法，利用后缀树(sufixtree)存储，搜索数据，可以达到C*O(n)的复杂度-suffix several storage algorithm, the use of the suffix tree (sufixtree) storage, search, which can reach C * O (n) the complexity
消除左递归得到后缀式
- 解法:对原文法消除左递归,根据消除左递归后的等价文法建立语法树,而后对此语法树 进行后根遍历,即可得到后缀式.- Solution: Eliminates the left recursion to the original grammar, after equal in value grammar establishment grammar tree which eliminates the left recursion, aft
libsfxdisk-1[1].2.tar
- 后缀数存储算法，利用后缀树(sufixtree)存储，搜索数据，可以达到C*O(n)的复杂度-suffix several storage algorithm, the use of the suffix tree (sufixtree) storage, search, which can reach C* O (n) the complexity
实验7 二叉树 北京师范大学数学科学院
- 自创的算法，输入表达式，建立二叉树的程序，然后输出前缀中缀后缀表示法，利用的对表达式的分割与递归实现输入，同时这也是一个完整的波兰式转换程序，相当稳健-own algorithm, the importation of expression, the establishment of the binary tree and then output the suffix prefix which is made up of the met
suffixtree
- 中科院计算所的关于后缀树的一个ppt,内容是英文的-calculation of the Chinese Academy of Sciences on a suffix tree ppt, as is the English
main
- 后缀树构造软件-Suffix Tree Construction Software
BinaryTreeoperation
- 二叉树的前序中序后序遍历操作，以及后缀表达式计算-Binary Tree Preorder traversal sequence after sequence of operations, as well as the suffix expressions calculated
change
- 中缀表达式转后缀表达式，建立二叉表达式树，利用二叉表达式树求解 -Infix to suffix expressions expression, the establishment of binary expression tree, the use of binary expression tree to solve
suffix_tree
- 后缀树的算法实现。基本定义在suffixtree.h中，具体实现参见suffixtree.c.-Suffix tree algorithm. Basic definitions in suffixtree.h, the concrete realization see suffixtree.c.
houzhui_tree
- 本代码是对后缀树进行构建，然后对构建的后缀树进行一些简单操作，运用后缀树计算最长子序列-create the tiretree ,then calculate the longest common squenece of two string by using tiretree
SuffixTree
- 重要算法后缀树的实现，非常实用-Important algorithm for the realization of the suffix tree
10253
- 本代码是在KMP算法上加以改进后，实现对一个字串求最长重复子序列。该算法可以与后缀树有相同原理。-The code is in the KMP algorithm be improved to realize for the longest string of a repeat sequence. The suffix tree algorithm with the same principle.
Linear_Suffix_Array_Construction
- 另外一篇后缀数组的算法论文，非常高效，而且附上了详细的证明。显示出与后缀树的优势-Suffix Array
tree
- 算术表达式与二叉树之间存在着对应关系，编写把以前缀形式输入的合法算术表达式转换为中缀表达式，再转换为后缀表达式，并求表达式的值-Arithmetic expressions with binary tree there is a correlation between the preparation of the form to enter the legitimate prefix arithmetic expression conv
suffix_Tree
- 后缀树构造程序，输入字符串，产生该字符串的后缀树结构-Suffix tree construction process, input string, resulting in the string suffix tree structure
suffix
- 倍增算法实现后缀数组，在字符串处理当中，后缀树和后缀数组都是非常有力的工具，其中后缀树大家了解得比较多，关于后缀数组则很少见于国内的资料。-suffix array