搜索资源列表
mystack1008
- 包括栈的push\\pop,计数,查找等操作,简单易行,适合数据结构的初学者-including Stack push \\ pop, calculators, searching operation is simple, the data structure suitable for beginners
Mysplit
- 种子填充算法用来在封闭曲线形成的环中填充某中颜色,在这里我们只填充黑色。种子填充其实上是图形学中的算法,其原理是:准备一个堆栈,先将要填充的点push进堆栈中;以后,每pop出一个点,将该点涂成黑色,然后按左上右下的顺序查看它的四个相邻点,若为白(表示还没有填充),则将该邻点push进栈。一直循环,直到堆栈为空。此时,区域内所有的点都被涂成了黑色。这里,我们自己定义了一些堆栈的数据结构和操作,实现了堆栈的初始化、push、pop、判断是否为空、及析构。 -seed filling algorit
stack
- 用c++实现了一个比较特殊的堆栈类,可以push,可以pop,输出测试栈顶指针的变化。
Stack
- 堆栈的实现代码,实现了栈的所有功能,PUSH,POP,插入,销毁,清空等,有调试程序,可以很清楚的看到栈的运行过程
stack.rar
- 用栈实现算式的运算,通过把操作符压栈和操作符的优先级进行运算。,Formula used to achieve the computing stack, push through the operator and operator to operator priority.
program
- 设计实现4bit FIFO, 数据深度为8, 产生满, 空状态标志-The diagram of FIFO is shown in figure 1. The FIFO consists of two component: FIFO control logic and RAM. The control logic generates the address (ADD) and write enable (WE) to the RAM so that the fi
Stack
- This a Stack Class with Funtions Push,Pop, check Stack is Full or Empty Application: Change a number from Decimal to Binary-This is a Stack Class with Funtions Push,Pop, check Stack is Full or Empty Application: Change a number from
Stack
- 简单模拟栈的操作:包括栈的初始化,压栈,栈顶元素弹出以及取栈顶元素;采用C实现-Analog stack easy steps: including the stack initialization, push, pop elements as well as the Top-Top-check elements implementation using C
adt_stack
- 栈是允许在同一端进行插入和删除操作的特殊线性表。允许进行插入和删除操作的一端称为栈顶(top),另一端为栈底(bottom);栈底固定,而栈顶浮动;栈中元素个数为零时称为空栈。插入一般称为进栈(PUSH),删除则称为退栈(POP)。 栈也称为后进先出表(LIFO表)。-Create stack Push stack Pop stack Stack top Empty stack Full stack Stack count Destroy stack
stack
- C++实现的各种堆栈操作(完整版 包括:build push pop等)-stack operation
STACKMAT
- program on stack push pop
stack
- 使用C语言实现数据堆栈功能,数据类型可自定义,pop,push操作性能较好-Data stack using the C language functions, data types can be customized, pop, push the operational performance is better
push
- 提供一个数据结构中常用的堆栈函数,非常有用,对于初学数据结构的人非常有帮助。-Provide a common data structure stack function, very useful data structure for the beginner who is very helpful.
pic
- 对任意给定的图(顶点数和边数自定),建立它的邻接表并输出,然后利用堆栈的五种基本运算(清空堆栈、压栈、弹出、取栈顶元素、判栈空)实现图的深度优先搜索遍历和广度优先搜索遍历算法。 -For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stac
stack
- 栈的基本操作,压栈,出栈,初始化以及判定栈是否为空-The basic operation of the stack, push, stack, initialization, and to determine whether the stack is empty
stack
- 基本的栈操作,初始化,pop,push,设置空等-stack operate
stack
- 栈是限制仅在表的一端插入和删除的线性表,是生活中某些过程的抽象。插入和删除操作的一端称为栈顶,插入操作称作入栈(Push),删除操作称作出栈(Pop)。栈顶元素总是最后进栈的,和最先出栈的;而栈底元素是最先进栈,最后出栈。栈具有后进先出(LIFO)的特性。顺序栈是栈的顺序存储结构的实现。链栈是栈的链式存储结构的实现。-Stack is limited only to one end of the table insert and remove a linear form, is the life
2037
- 假设一个存储结构实现双向堆栈顺序,也就是说,一维数组的储存空间,有两个堆栈,他们位于底部的堆阵列的两个端点。尝试着去写实现双向堆Tws三种操作:最初的inistack(Tws),到堆栈推(Tws,我、x)和堆栈流行(Tws,我)算法,该算法可以我0或1,所以分别在一个数组或指示两端的两个堆栈。-Suppose a storage structure order implement a two-way stack, that is, the one dimensional array of sto
VC.push.stack.design.code
- VC堆栈推开发设计经典代码VC to push development of stack design classic code -VC to push development of stack design classic code
push
- 用数组实现栈和队列C++ 代码实现,经典-array stack c++