深度优先迷宫求解实例(C)

//maze.h
#define RIGHT 0
#define DOWN  1
#define LEFT  2
#define UP    3
typedef struct Position{  //位置
    int x; //行
    int y; //列
}Position;


//顺时针从右开始寻找临近位置，返回该临近位置
Position NextPos(Position now, int dir){
    Position next;
    int x = now.x;
    int y = now.y;

    switch(dir){
        case RIGHT: next.x = x; next.y = y+1; break; //向右走一格
        case DOWN:  next.x = x+1; next.y = y; break; //向下走一格
        case LEFT:  next.x = x; next.y = y-1; break; //向左走一格
        case UP:    next.x = x-1; next.y = y; break; //向上走一格
    }
    return next;
}

//mazeStack.h
#include <stdlib.h>
#include <stdio.h>
#include "maze.h"
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
#define MAXSIZE 1000
typedef int Status;

//存入栈中的元素
typedef struct Ele{
    Position pos; //当前位置
    int step;     //当前步数
    int dir;      //当前方向
}Ele;

typedef struct{
    int Stacksize;
    Ele* top;
    Ele* base;
}Stack;

//创建一个栈，返回该栈。创建失败返回NULL
Stack* InitStack(void){
    Stack* s = (Stack*)malloc(sizeof(Stack));
    s->base = (Ele*)malloc(STACK_INIT_SIZE*sizeof(Ele));
    if(!s->base){
        //内存分配失败
        printf(