搜索资源列表
fill_point
- 种子填充算法,先把种子像素如栈,再逐点扫描该点左右边界之间的像素,并置成新的像素,即完成一条扫描线的转换,然后再取上下扫描线并重复上面的过程,即完成填充.-seed filling algorithm, the first seed pixels as stack, then scan the point-by-point about the border between the pixels, home and a new image, namely, the completion of a
经典迷宫问题实现
- 经典迷宫问题实现，利用栈记录路径。本算法找到的并非最短的路径。
draw
- 1.画填阴影线的任意多边形，阴影线间距，角度可调 2.多项式加减法 3.栈与队列（10进制转16进制，入栈，出栈，入队，出队，销毁队列，显示队列）-1. Draw the line polygon fill in the shadow, shadow line spacing, angle adjustable 2. Polynomial Addition and Subtraction 3. Stacks and queues (10 decimal 16 hex transfer,
tianchong
- 利用填充算法，借助栈的结构，完成对图形的填色过程。先画出封闭图形，然后使用填充对其涂色。-Filling algorithm, with the structure of the stack, complete the coloring process graphics. First to draw closed graph, and then use fill its coloring.
polygon
- 在VC++6.0中，设计种子填充算法演示软件，分别演示递归算法、用栈实现非递归【深度遍历】、用队列实现非递归【广度遍历】，绘制简单的多边形-In vc++ 6.0, presentation software design seed filling algorithm, illustrate each recursive algorithm, using stack to realize non-recursive traversal 】 【 depth, with a queue to rea