栈---简单迷宫

用一个m×n的矩阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对给定的迷宫，求出找到的第一条从入口到出口的通路，或得到没有通路的结论。
我们指定:
(1) 迷宫的入口为矩阵的左上角（1,1），迷宫的出口为右下角（m,n）;
(2) 路径的探索顺序为: 东(右)、南(下)、西(左)、北(上)。

#include<stdio.h>
#include<malloc.h>
typedef struct node{
	int i;
	int j;
	int k;
	struct node * next;
	struct node * left;
}Node; 
int arr[20][20];
Node * tail;
Node * create_stack()
{
	Node * top;
	top = (Node *)malloc(sizeof(Node));
	top->next = NULL;
	top->left = NULL;
	return top;
}
void pushStack(Node * top,int i,int j,int k)
{
	Node * q;
	q = (Node *)malloc(sizeof(Node));
	q->i = i;
	q->j = j;
	q->k = k;
	if(top->next == NULL)
	{
		q->next = top->next;
		top->next = q;
		q->left = top;
		tail = q;
	}
	else
	{
		q->next = top ->next;
		q->left = top;
		top ->next = q;
		q->next->left = q;
	}
} 
void popStack(Node * top)
{
	Node * p;
	p = top->next;
	top->next =p->next;
	if(p->next == NULL)
	{
		top->next = NULL;
	}
	else
	{
		p->next->left = top;
	}

	free(p);
}

int main()
{
	int m,n;
	scanf("%d %d",&m,&n);
	int	i = 0,j = 0;
	for(i = 0;i < m;i++)
	{
		for(j = 0;j <n;j++)
		{
			scanf("%1d",&arr[i][j]);
		}
	}
	Node * top = create_stack();
	i = 0,j = 0;
	while(i != m-1 || j != n-1)
	{
		if(arr[i][j+1] == 0 && j+1<n)//向右1
		{
			pushStack(top,i,j,1);
			arr[i][j] = 3; 
			j++;
		}
		else if(arr[i+1][j] == 0 && i+1<m)//向下2
		{
			pushStack(top,i,j,2);	
			arr[i][j] = 3; 
			i++;
		}
		else if(arr[i][j-1] == 0 && j-1>=0)//向左3
		{
			pushStack(top,i,j,3);
			arr[i][j] = 3;
			j--; 
		}
		else if(arr[i-1][j] == 0 && i-1>=0)//向上4
		{
			pushStack(top,i,j,4);
			arr[i][j] = 3;
			i--; 
		}else{
			arr[i][j] = 3;
			i = top->next->i;
			j = top->next->j;
            arr[i][j] = 0;
			popStack(top);
		}
	}
	pushStack(top,i,j,0);
	while(tail!=top)
	{
		printf("(%d,%d,%d)",tail->i+1,tail->j+1,tail->k);
		tail=tail->left;
	}
	return 0;
}

若没有出路 判断栈是不是空