Maze problem

Maze Problem Discussion - (Stack)

I: Method for stacking with labyrinth: Seeking an algorithm from the path from the entrance to the exit to the exit to be described as follows: Set the initial value of the current location as the entry location: DO {If the current location is available, then {will current location Insert the top; if this location is the outlet location, then end; otherwise switch the east neighbor block of the current location is a new current location;} Otherwise, if the stack is not empty and the top position does not have other directions; The new current location is the next phase neighbor block along the top of the stack of clockwise; if the stack is not available, the stack is not easy, then {delete the top position of the stack; if the stack is not empty, then Repeat the top position of the new stack until you find an accessible adjacent or out of the stack to the stack;}} (stack is not empty)

Typedef struct {int order; // channel block in the path "Sequence" postype seat; // channel block in the "coordinate position" INT DI; / / from this channel block to the "direction" of the next channel block} SELEMTYPE; / / Stack element type

Status MazePath (Maztype Maze, Post, Postype End) {// If there is a channel from the entry start to the exit end in the maze maze, you will find a storage in the stack (from the bottom of the stack to the stack), and return true; Otherwise, returning falseinitstack (s); curpos = start; // Set "Current position" is "inlet position" curStep = 1; // Explore the first step Do {if (Pass (curpos) {// The current location can pass That is, there is no passage that has never been passed. Footprint (curpos); // Leave footprint E = (Curstep, Curpos, 1); Push (s, e); // Add path IF (curpos == end) Return (True ); // reach the endpoint (export) curpos = nextpos (CURPOS, 1); // Next is the east of the current location CursteP ; // Explore the next step} else {// Current location cannot pass if (! Stackempty (s) )) {POP (s, e); while (e.di == 4 &&! Stackempty (s)) {markprint (e.seat; POP (s, e)); // Leave a flag that cannot pass, and returns One step} if (e.di <4) {E.DI ; push (s, e); // Replace the direction to explore curpos = nextpos (e.seat, e.di); // Setting the current location is Neighbor Blocks in the New Direction}}}}}}} } While (! Stackempty (s)); return (false);}

Posted on June 26, 2004 2:13 AM

HREF = "/ iampolaris / services / pingback.aspx" Rel = "pingback">

Feedback

# 回 问题 Discussion - (Stack) I have encountered a problem when using C # to realize the maze problem, is using the C # Stack class, but I want to put the Struct structure as an element into the stack, or pop up the top element .

I tried it and saw MSDN's explanation. It seems that the STACK class does not support multiple values ​​to press or pops up. This is understandable, but how to put the struct structure element into or pop up? Who knows what this is? What about the reason?

code show as below:

Using system;

Using system.drawing;

Using system.collections;

Using system.componentmodel;

Using system.windows.forms;

Using system.data;

Namespace STKMAZE

{

///