用矩阵来设置一个迷宫,例:九乘九矩阵迷宫
{0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,
0,0,1,1,1,1,0,1,0,
0,0,0,0,0,1,0,1,0,
0,0,1,0,0,0,0,1,0,
0,0,1,0,1,1,0,1,0,
0,0,1,0,0,0,0,1,1,
0,0,1,0,0,1,0,0,0,
0,0,1,1,1,1,1,1,0} 从(1,1)出发,到(8,8)
方法一:广度优先搜索(矩阵存储) 迷宫,得到最短路径
#include<stdio.h>
#include<stdlib.h>
#define size 100//队列大小
typedef struct Node
{
int x;
int y;
int pre;
Node *next;
}Node;
void No(Node &sq)//创建队列
{
sq.next=(Node *)malloc(size * sizeof(Node));
}
void out(Node &sq,int qe)//最短路径输出
{
printf("最短路径是(倒序):\n");
printf("(%d,%d)",sq.next[qe].x,sq.next[qe].y);
while(sq.next[qe].pre>0)
{
qe=sq.next[qe].pre;
printf("<--(%d,%d)",sq.next[qe].x,sq.next[qe].y);
}
}
int check(int i,int j,int m[9][9])//判断下一步是否可走
{
int flag=1;//可行
//是否在迷宫内
if(i<1||i>8||j<1||j>8)
{
flag=0;//不可行
}
// 判断是否能走
if(m[i][j]==1||m[i][j]==-1)
{
flag=0;//不可行
}
return flag;
}
int search(int qh,int qe,Node &sq,int m[9][9],int fx[],int fy[])//在迷宫中寻找最短路径
{
int k,i,j;
qh=0;
qe=1;
m[1][1]=-1;
sq.next[1].pre=0;
sq.next[1].x=1;
sq.next[1].y=1;
//当队列不空
while(qh!=qe)
{
//出队
qh++;
//搜索下一步
for(k=1;k<=4;k++)
{
i=sq.next[qh].x+fx[k];
j=sq.next[qh].y+fy[k];
if(check(i,j,m)==1)
{
//入队
qe++;
sq.next[qe].x=i;
sq.next[qe].y=j;
sq.next[qe].pre=qh;
m[i][j]=-1;
if(sq.next[qe].x==8&&sq.next[qe].y==8)
{
out(sq,qe);
return 0;
}
}
}
}
printf("没有找到路径");
}
int main()
{
int m[9][9]={{0,0,0,0,0,0,0,0,0},
{0,0,0,0,0,0,0,0,0},
{0,0,1,1,1,1,0,1,0},
{0,0,0,0,0,1,0,1,0},
{0,0,1,0,0,0,0,1,0},
{0,0,1,0,1,1,0,1,0},
{0,0,1,0,0,0,0,1,1},
{0,0,1,0,0,1,0,0,0},
{0,0,1,1,1,1,1,1,0}};
int fx[5]={0,1,-1,0,0};//控制上下左右的坐标变化
int fy[5]={0,0,0,-1,1};
int qh;//队首下标
int qe;//队尾下标
Node sq;
No(sq);
search(qh,qe,sq,m,fx,fy);//查找最短路径
return 0;
}
方法二:深度优先搜索(矩阵存储)迷宫,得到非最短路径
#include<stdio.h>
#include<stdlib.h>
void out(int m[9][9])//输出地图
{
int i,j,number=0;
printf("地图为:\n");
for(i=0;i<9;i++)
{
for(j=0;j<9;j++)
{
if(m[i][j]==3)
{
printf("* ");
number++;
}else
{
printf("%d ",m[i][j]);
}
}
printf("\n");
}
printf("\n步数%d",number);
printf("此路径不是最短路径,而是一个可通行路径");
}
int check(int i,int j,int m[9][9],int fx[],int fy[],int k)//判断下一步是否可走
{
i=i+fx[k];
j=j+fy[k];
int flag=1;//可行
//是否在迷宫内
if(i<1||i>8||j<1||j>8)
{
flag=0;//不可行
}
if(m[i][j]!=0)
{
flag=0;
}
return flag;
}
int search(int i,int j,int m[9][9],int fx[],int fy[])//在迷宫中寻找可行路径
{
int k,newi,newj;
for(k=1;k<=4;k++)
{
if(check(i,j,m,fx,fy,k)==1)
{
newi=i+fx[k];
newj=j+fy[k];//新位置
m[newi][newj]=3;
if(newi==8&&newj==8)
{
out(m);
return 0;
}else
{
search(newi,newj,m,fx,fy);
}
}
}
m[i][j]=2;//死胡同
}
int main()
{
int m[9][9]={{0,0,0,0,0,0,0,0,0},
{0,0,0,0,0,0,0,0,0},
{0,0,1,1,1,1,0,1,0},
{0,0,0,0,0,1,0,1,0},
{0,0,1,0,0,0,0,1,0},
{0,0,1,0,1,1,0,1,0},
{0,0,1,0,0,0,0,1,1},
{0,0,1,0,0,1,0,0,0},
{0,0,1,1,1,1,1,1,0}};
int fx[5]={0,1,-1,0,0};//控制上下左右的坐标变化
int fy[5]={0,0,0,-1,1};
m[1][1]=3;//起始位置
search(1,1,m,fx,fy);//找路径
return 0;
}