搜索资源列表
Maze
- 数据结构的课程设计，利用堆栈的后进先出保存从起点开始的每一步行走。可以自定义迷宫地图，并在地图上标明，和用坐标表示行走路线。-Data structure of the curriculum design, use of the LIFO stack to preserve from the starting point for each walk away. Can customize the maze map and marked
Stack
- a stack is a last in, first out(LIFO) abstract data type and data structure
queue
- a queue (lifo memory) algo
colaenlazada
- Linked List with the LIFO behavior
adt_stack
- 栈是允许在同一端进行插入和删除操作的特殊线性表。允许进行插入和删除操作的一端称为栈顶(top)，另一端为栈底(bottom)；栈底固定，而栈顶浮动；栈中元素个数为零时称为空栈。插入一般称为进栈（PUSH），删除则称为退栈（POP）。 栈也称为后进先出表（LIFO表）。-Create stack Push stack Pop stack Stack top Empty stack Full stack Stack
20081_L2_CodiEnunciat
- the program is un LIFO stack from learning instructions of compilator program is a pract university and it writ in java -the program is un LIFO stack from learning instructions of compilator program is a pract universit
StackExample
- Simple Stack example. Which show you how to implement LIFO in stack using link list.
lifo
- this program is stack segment overflow using vb.
8888
- 主要是对数据结构中栈的知识的运用，实现了先进后出，后进先出的原理-Mainly in the stack data structure knowledge, to achieve the advanced post out the principle of LIFO
Practica1
- A FIFO and LIFO source code
zidongji
- 本结构是以状态间的弧为核心定义的。其中s1和s2为该弧的初态和终态，s为该弧上接收的字母，in和out分别表示在接收字母后进栈和出栈的字母。为了方便查找和不使弧的个数受到限制，本程序将节点以链表的方式存储-This structure is state between the arc as the core defined. One for the arc s2 s1 and the initial state and eventual
stack
- 它按照后进先出的原则存储数据，先进入的数据被压入栈底，最后的数据在栈顶，需要读数据的时候从栈顶开始弹出数据（最后一个数据被第一个读出来）。 -It is in accordance with the principle of LIFO store data, first enter the data is pushed onto the stack at the end, the last data in the top of the
Expression-evaluation
- 表达式求值主要使用的数据结构是栈，因为栈具有后进先出的特点，与表达式求值时的符号和数值运算过程是刚好相符合的。表达式求值也是栈的一个典型的运用。-Expression evaluation is the main data structure used in the stack, because the stack has the characteristics of LIFO, and expression evaluation wh
Solving-expressions
- 简单算术表达式的求解,利用栈的后进先出的特点,加入了对算式合法性的判断-Solving simple arithmetic expression, the use of LIFO stack characteristics, added to the formula to determine the legality of
stack
- 栈是限制仅在表的一端插入和删除的线性表，是生活中某些过程的抽象。插入和删除操作的一端称为栈顶，插入操作称作入栈（Push），删除操作称作出栈（Pop）。栈顶元素总是最后进栈的，和最先出栈的；而栈底元素是最先进栈，最后出栈。栈具有后进先出（LIFO）的特性。顺序栈是栈的顺序存储结构的实现。链栈是栈的链式存储结构的实现。-Stack is limited only to one end of the table insert and rem
Stack-and-Queue-FIFO
- Queue是先进先出的集合而Stack是后进先出的集合-Queue is a collection of FIFO Stack is a LIFO collection
Stack--FIFO
- Queue是先进先出的集合而Stack是后进先出的集合-Queue is a collection of FIFO Stack is a LIFO collection
stack_16x8
- VHDL语言写的16x8堆栈模块设计，存储器全满时给出信号并拒绝继续存入；读出时按后进先出原则；存储数据一旦读出就从存储器中消失；有相应的testbech文件，经测试可用。对小型设计很有用！欢迎下载交流学习。-Write VHDL 16x8 stack module design, memory signal is given full and refused to continue the deposit readout LIFO
Lecture_06-(Stacks)
- The stack is the simplest of data structures. Placing something onto the stack and removing something from the stack is restricted to the top of the stack. That is why it is also defined as Last In First Out (LIFO) sto
stack1
- a stack is a particular kind of abstract data type or collection in which the principal (or only) operations on the collection are the addition of an entity to the collection, known as push and removal of an entity, know