c++用队列写的迷宫代码

#include "stdio.h"
#include "malloc.h"
#define Maxsize 100
struct{
      int i;
  int j;
  int pre;
}Qu[Maxsize];
int x,y,xi,yi,xe,ye,front,rear;
void cmg(int (*mg)[Maxsize])
{ int n,m;
  printf("请输入迷宫的行和列x y:");
  scanf("%d %d",&x,&y);
for(n=1;n<=x;n++)
   for(m=1;m<=y;m++)
   {mg[n][m]=0;
   }

   
  printf("请输入入口坐标xi yi:");
  scanf("%d %d",&xi,&yi);
  printf("请输入出口坐标xe ye:");
  scanf("%d %d",&xe,&ye);
  for(n=1;n<=x;n++)
  {mg[n][0]=1;
   mg[n][x+1]=1;
  }  
  for(n=0;n<=y+1;n++)
  {mg[0][n]=1;
   mg[x+1][n]=1;