C语言利用队列求解迷宫问题

#include <stdio.h>
#include <stdlib.h>
#define M 4
#define N 4
#define MaxSize 10
int mg[M + 2][N + 2] = {
   
	{
   1,1,1,1,1,1},
	{
   1,0,1,0,0,1},
	{
   1,0,0,0,1,1},
	{
   1,1,0,1,1,1},
	{
   1,1,0,0,0,1},
	{
   1,1,1,1,1,1}
};
typedef struct
{
   
	int i;//行
	int j;//列
	int pre;//上一个方块在队列中的下标
}Box;