c语言数据结构迷宫

#ifndef STACK_H_INCLUDED
#define STACK_H_INCLUDED


#include <stdio.h>
#include <stdlib.h>
#include <string.h>


#define STACK_INIT_SIZE 30
#define STACK_INCR_SIZE 5


typedef struct
{
    int x ;
    int y ;
} PosType ;


typedef struct
{
    PosType position ;
    int direction  ;
} ElemType ;


typedef struct Sqstack
{
    ElemType* Sbase ;

    ElemType* Stop ;
    int StackSize ;
} Sqstack ;




int InitStack( Sqstack* s ) ;
int DestroyStack( Sqstack* s ) ;
int GetTop( Sqstack* s , ElemType* e ) ;
int GetLength( Sqstack* s ) ;
int Push( Sqstack* s , ElemType e ) ;
int Pop( Sqstack* s , ElemType* e ) ;
int IsEmpty( Sqstack* s ) ;
int ClearStack( Sqstack* s ) ;
//int TraveserStack( Sqstack* s ) ;


#endif // STACK_H_INCLUDED




#ifndef MAZE_H_INCLUDED
#define MAZE_H_INCLUDED
#include "stack.h"
#define ROW 10
#define COL 10

int MazePath(Sqstack* s,int maze[ROW][COL] ) ;