该算法将路径栈算法的思想应用到它的主算法中实现了小枝模式查询。
The algorithm utilized the idea of PathStack algorithm in its main algorithm to achieve twig pattern query.
文章给出了1至N全排列问题的三种求解算法，分析了该问题在栈及二叉树计数中的应用。
This article gives three algorithms for all permutations of 1 to N, analyzing the application of this problem in stack and enumeration of binary tree.
然后提出栈-散列表符号管理模型，并给出相应的数据结构和实现算法；
Then we bring forward the stack-hash model of label management, and submit data structures and implement algorithms corresponding to this model.
和中缀转换后缀的算法相反，那是把操作符存储在栈里。
This is the opposite of the infix to postfix translation algorithm, where operators were stored on the stack.
并在此基础上提出了基于栈结构的支持度计算算法，该算法仅对数据库进行一次扫描，即可实现候选序列的计数操作。
Then it presents a support computing algorithm based on stack structure, which can count the candidate sequences by scanning the database only once.
分析递归算法的栈实现以及用栈运算转换递归算法为非递归算法，阐述递归思想及其应用。
The realizing recursive algorithm by stack and the Changing recursive algorithm into non-recursive by stack operation are studied. The thinking of recursion and its application are expounded.
通过分析具体问题，抓住栈结构与栈元素材料的桥梁作用，从而写出迷宫问题的算法。
This paper, by analysing some specific problems, grasps the bridge of both stack structure and stack element, and obtains the related algorithm of the maze problems.
改进后的算法不增加入栈出栈操作的次数，却免除了原算法中为获取众多象素颜色值所需要的大量重复操作。
This algorithm avoids the numerous repeated operations for getting many pixel color values without increasing the number of push and pop operations.
这一公理说明每个栈的关系与有限元素序列系统是同构的。关键词栈；算法?。
The representation theorem stating that every relational system of stacks is isomorphic to a system of finite sequences of elements is proved.
这一公理说明每个栈的关系与有限元素序列系统是同构的。关键词栈；算法?。
The representation theorem stating that every relational system of stacks is isomorphic to a system of finite sequences of elements is proved.
应用推荐