个人写的迷宫源代码.docxVIP

// Proj_MiGongGraphDis.cpp : Defines the entry point for the console application.//#include stdafx.h #include graphics.h#includestdio.h#include stdlib.h#include time.h #include easyx.h #include time.h#define rightNeib 0#define downNeib 1 #define UpToward 1#define LeftToward 2 #define DownToward 3 #define RightToward 4 #define RowNum 30#define ColumnNum 30#define GridNum 900#define RandWallNum 50000 int a[RowNum][ColumnNum]={0};int b[GridNum]={0};int c[GridNum]={0};//int b[cnt_row][cnt_clolumn]={0}; //int c[cnt_row][cnt_clolumn]={0}; struct arynode {bool upward;bool left;bool downward;bool right;int LastX;int LastY;bool visited; } arry[RowNum][ColumnNum]; struct Lst {int x;int y; struct Lst *next;bool merged;//是否曾经合并int head_x; //当前节点的链表头坐标int head_y; int head_sign; };struct Lst * LstArry[RowNum][ColumnNum]; int posi_X=0; int posi_Y=0; int Dire_sign=0; int Excecut_sign=0; int N_find=0; int dot_num=1; int m=0; int n=0; int Group_num=0; int start_node_x=0; int start_node_y=0; int end_node_x=RowNum-1; int end_node_y=ColumnNum-1; //--初始化N*N迷宫-------start----***********//void InitMiGong(); //初始化N*N迷宫void InitArry(arynode arry[][ColumnNum]);//初始化迷宫中各个节点的通断情况void InitSemble();struct Lst *FindTailNode(struct Lst *Pnode);void Merge2semble();int FindPoint(struct Lst *headnod,int X,int Y);int SameSemble(int *point_start_x,int *point_start_y,int *point_end_x,int *point_end_y );int FunJudeEnd();//struct Lst * creatMiG(struct Lst * headnod);//创建迷宫void RemoveRinge(); //初始化--拆墙---绘图void InitArryVisited(arynode arry[][ColumnNum]);//初始化--所有的点单元设置为未访问void ResetHeadValue(struct Lst *headnod,int X,int Y); //--初始化N*N迷宫-------end----***********// //--行走路径的链表操作----start----***********//int funcArry(arynode Arry[][ColumnNum],int i,int j);//查找迷宫出口主函数 struct Lst* headNode; struct Lst* InitLstNode(int InPutX,int InPutY); struct Lst * AddLstNode(struct Lst *head,int InPutX,int InPutY)