求助帖！！！如何运用C++语言编写一个随机生成迷宫并找出最短路径的程序

#include<iostream>
using namespace std;
#define MAXSIZE 200
#define m 999
#define n 999
typedef struct
{
 int i, j, di;
}Queue;
Queue Stack[MAXSIZE], Path[MAXSIZE];//栈和存放最短路径长度的数组
int top = -1, count = 1, minlen = MAXSIZE;//栈顶指针，路径计数器，最短路径长度
const int move[4][2] = {
 { -1,0 },{ 0,1 },{ 1,0 },{ 0,-1 } };
int mark[m][n];   //标志数组
int maze[m][n];   //迷宫数组
int i1 = 1, j1 = 1, i2 = 10, j2 = 10, m1 = 11, n1 = 11;  //入口，出口坐标，迷宫大小
void Init_maze();        //初始化系统自带迷宫
void NewCreat();        //新建迷宫
void Put_in();          //输入进出口
void PutOut_all();     //找所有路径和最短路径并输出所有路径
void PutOut_Grap();  //输出迷宫图形
void Migong();       //使用迷宫

void Init_maze()
{
 int i;
 for (i = 0; i <= m1; i++)
  for (int j = 0; j <= n1; j++)
  {
   maze[i][j] = 1;
   mark[i][j] = 0;
  }
 for (i = 1; i <= 6; i++)maze[1][i] = 0;
 maze[1][8] = maze[2][1] = maze[2][3] = 0;
 for (i = 6; i <= 10; i++)maze[2][i] = 0;
 maze[3][1] = maze[3][3] = maze[3][6] = maze[3][10] = 0;
 maze[4][1] = maze[4][9] = maze[4][10] = maze[5][1] = 0;
 for (i = 3; i <= 7; i++)maze[4][i] = 0;
 for (i = 1; i <= 3; i++)maze[6][i] = 0;
 for (i = 7; i <= 10; i++)maze[6][i] = 0;
 maze[6][5] = maze[7][1] = maze[7][5] = maze[7][6] = 0;
 maze[7][7] = maze[9][3] = maze[9][8] = maze[9][10] = 0;
 for (i = 1; i <= 5; i++)maze[8][i] = 0;
 for (i = 8; i <= 10; i++)maze[8][i] = 0;
 maze[10][8] = maze[6][4] = maze[8][7] = maze[10][10] = 0;
}
//构建系统迷宫

这段代码如何分析呀？求大佬指点！！！