迷宫求解
问题描述
输入: 迷宫的长、高,以及起始位置,终点位置;最大允许步数
输出:是否能通过迷宫
算法描述
该算法主要是通过迪杰斯特拉算法求解起点到终点的最小距离
代码实现
common.h
#include <stdlib.h>
#include <limits.h>
#define TRUE 1
#define FALSE 0
#define OK 0
#define ERR 1
#define MEM_ALOC_ERR 3
#define INFINITY INT_MAX
ShortestPath_Dijkstra.c 迪杰斯特拉算法[^footnote]
/*
============================================================================
Name : ShortestPath_Dijkstra.c
Author : Glarple
Version :
Copyright : SpecialLove
Description : Hello World in C, Ansi-style
============================================================================
*/
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include "common.h"
void setGraph(int **graph, int i, int j, int m, int type) {
switch (type) {
case 0:
//maz[i][j] 是墙,无其他节点到该节点
/*graph[i*m+j][(i-1)*m+j] = 0;
graph[i*m+j][(i+1)*m+j] = 0;
graph[i*m+j][i*m+j-1] = 0;
graph[i*m+j][i*m+j+1] = 0;*/
break;
case 1:
//maz[i][j] 上方可通行
graph[i * m + j][(i - 1) * m + j] = 1;
break;
case 2:
//maz[i][j] 下方可通行
graph[i * m + j][(i + 1) * m + j] = 1;
break;
case 3:
//maz[i][j] 上方可通行
graph[i * m + j][(i - 1) * m + j] = 1;
//maz[i][j] 下方可通行
graph[i * m + j][(i + 1) * m + j] = 1;
break;
case 4:
//maz[i][j] 左方可通行
graph[i * m + j][i * m + j - 1] = 1;
break;
case 5:
//maz[i][j] 上方可通行
graph[i * m + j][(i - 1) * m + j] = 1;
//maz[i][j] 左方可通行
graph[i * m + j][i * m + j - 1] = 1;
break;
case 6:
//maz[i][j] 下方可通行
graph[i * m + j][(i + 1) * m + j] = 1;
//maz[i][j] 左方可通行
graph[i * m + j][i * m + j - 1] = 1;
break;
case 7:
//maz[i][j] 上方可通行
graph[i * m + j][(i - 1) * m + j] = 1;
//maz[i][j] 下方可通行
graph[i * m + j][(i + 1) * m + j] = 1;
//maz[i][j] 左方可通行
graph[i * m + j][i * m + j - 1] = 1;
break;
case 8:
//maz[i][j] 右方可通行
graph[i * m + j][i * m + j + 1] = 1;
break;
case 9:
//maz[i][j] 上方可通行
graph[i * m + j][(i - 1) * m + j] = 1;
//maz[i][j] 右方可通行
graph[i * m + j][i * m + j + 1] = 1;
break;
case 10:
//maz[i][j] 下方可通行
graph[i * m + j][(i + 1) * m + j] = 1;
//maz[i][j] 右方可通行
graph[i * m + j][i * m + j + 1] = 1;
break;
case 11:
//maz[i][j] 上方可通行
graph[i * m + j][(i - 1) * m + j] = 1;
//maz[i][j] 下方可通行
graph[i * m + j][(i + 1) * m + j] = 1;
//maz[i][j] 右方可通行
graph[i * m + j][i * m + j + 1] = 1;
break;
case 12:
//maz[i][j] 左方可通行
graph[i * m + j][i * m + j - 1] = 1;
//maz[i][j] 右方可通行
graph[i * m + j][i * m + j + 1] = 1;
break;
case 13:
//maz[i][j] 上方可通行
graph[i * m + j][(i - 1) * m + j] = 1;
//maz[i][j] 左方可通行
graph[i * m + j][i * m + j - 1] = 1;
//maz[i][j] 右方可通行
graph[i * m + j][i * m + j + 1] = 1;
break;
case 14:
//maz[i][j] 下方可通行
graph[i * m + j][(i + 1) * m + j] = 1;
//maz[i][j] 左方可通行
graph[i * m + j][i * m + j - 1] = 1;
//maz[i][j] 右方可通行
graph[i * m + j][i * m + j + 1] = 1;
break;
case 15:
//maz[i][j] 上方可通行
graph[i * m + j][(i - 1) * m + j] = 1;
//maz[i][j] 下方可通行
graph[i * m + j][(i + 1) * m + j] = 1;
//maz[i][j] 左方可通行
graph[i * m + j][i * m + j - 1] = 1;
//maz[i][j] 右方可通行
graph[i * m + j][i * m + j + 1] = 1;
break;
default:
break;
}
return;
}
int getAcessType(char *maze, int i, int j, int n, int m) {
int ret = 0;
if (i > 0 && '*' != *(maze + (i - 1) * m + j))
ret += 1;
if (i < n - 1 && '*' != *(maze + (i + 1) * m + j))
ret += 2;
if (j > 0 && '*' != *(maze + i * m + j - 1))
ret += 4;
if (j < m - 1 && '*' != *(maze + i * m + j + 1))
ret += 8;
return ret;
}
int shortestPath_DJL(int **graph, int startPos, int princePos, int vexNum) {
int *final; //final[i]为true表示节点i已加入到S中,即v0到vi已找到最短路径
int *distance; //v0到vi的距离
int i, j;
int min;
int mid = startPos;
int ret = 0;
final = (int *) malloc(sizeof(int) * vexNum);
distance = (int *) malloc(sizeof(int) * vexNum);
for (i = 0; i < vexNum; i++) {
final[i] = FALSE;
distance[i] = graph[startPos][i];
/*if(distance[i] < INT_MAX)
;*/
}
/*//diag
for (i = 0; i < vexNum; i++) {
printf("final[%d] is %d, distance[%d] is %d\n", i, final[i], i,
distance[i]);
}
///diag*/
final[startPos] = TRUE;
distance[startPos] = 0;
for (i = 0; i < vexNum; i++) {
min = INT_MAX;
for (j = 0; j < vexNum; j++) {
//printf("final[%d] is %d, distance[%d] is %d.\n",j, final[j],j, distance[j]);
if (!final[j] && distance[j] < min) {
min = distance[j];
mid = j;
}
}
//printf("min is %d, mid is %d.\n", min, mid);
final[mid] = TRUE;
for (j = 0; j < vexNum; j++) {
if (!final[j] && INT_MAX != graph[mid][j]
&& min + graph[mid][j] < distance[j]) {
distance[j] = min + graph[mid][j];
/*printf("graph[%d][%d] is %d, distance[%d] is %d\n", mid, j,
graph[mid][j], j, distance[j]);*/
}
}
}
/*//diag
puts("=====================");
for (i = 0; i < vexNum; i++) {
printf("final[%d] is %d, distance[%d] is %d\n", i, final[i], i,
distance[i]);
}
///diag*/
ret = distance[princePos];
free(final);
free(distance);
return ret;
}
/**
* visted 描述迷宫的字符串
* t: 表示公主能被救出的天数
* n:迷宫的长
* m: 迷宫的宽
*/
int SSavep(char *visited, int t, int n, int m) {
int **graph;
char *maze;
int i, j;
int nodeNum;
int startPos, princePos;
int accessType = 0;
int cost = 0;
//1、入参有效性检查
if (visited == NULL || n < 0 || n > 20 || m < 0 || m > 20 || t < 0
|| t > 10000)
return FALSE;
//2、将入参的迷宫字符串,转换成图
// 共n*m个节点,使用邻接矩阵表示
maze = visited;
nodeNum = n * m;
//动态为graph申请内存
graph = (int **) malloc(sizeof(int *) * nodeNum);
for (i = 0; i < nodeNum; i++) {
graph[i] = (int *) malloc(sizeof(int) * nodeNum);
}
//,然后将graph初始化为0,
for (i = 0; i < nodeNum; i++) {
for (j = 0; j < nodeNum; j++) {
graph[i][j] = INT_MAX; //路不通,默认置最大值 INT_MAX
}
}
/*///debug
puts("initial +++++++++++++++++++\n");
for (i = 0; i < nodeNum; i++) {
for (j = 0; j < nodeNum; j++) {
if (graph[i][j] == INT_MAX)
printf("0 ");
else
printf("%d ", graph[i][j]);
}
puts("\n");
}
puts("initial +++++++++++++++++++end\n");
debug*/
//设置graph中的值
for (i = 0; i < n; i++) {
for (j = 0; j < m; j++) {
//printf("maze[%d][%d] char is %c#\n", i, j, maze[i * m + j]);
switch (maze[i * m + j]) {
case '.':
//判断四周情况
accessType = getAcessType(maze, i, j, n, m);
//设置maze[i][j] 到上下左右节点的通达信息
setGraph(graph, i, j, m, accessType);
break;
case '*':
//所有节点都不能通过这条路
//setGraph(graph, i, j, 0);
break;
case 'S':
//起点
startPos = i * m + j;
//判断四周情况
accessType = getAcessType(maze, i, j, n, m);
//设置maze[i][j] 到上下左右节点的通达信息
setGraph(graph, i, j, m, accessType);
break;
case 'P':
//终点
princePos = i * m + j;
//判断四周情况
accessType = getAcessType(maze, i, j, n, m);
//设置maze[i][j] 到上下左右节点的通达信息
setGraph(graph, i, j, m, accessType);
break;
}
}
}
/*///debug
printf("startPos is %d, princessPos is %d\n", startPos, princePos);
puts("set +++++++++++++++++++\n");
for (i = 0; i < nodeNum; i++) {
for (j = 0; j < nodeNum; j++) {
if (graph[i][j] == INT_MAX)
printf("0 ");
else
printf("%d ", graph[i][j]);
}
puts("");
}
puts("set +++++++++++++++++++end\n");
debug*/
//3、Dijkstra算法求解出最短路径
cost = shortestPath_DJL(graph, startPos, princePos, nodeNum);
for (i = 0; i < nodeNum; i++)
free(graph[i]);
free(graph);
//4、判断最短路径和天数的大小,确认是否可以及时救出
if (cost <= t) {
printf("Used %d days, get out princess.\n", cost);
return OK;
} else {
printf("At lease need %d days, could not get out princess.\n", cost);
return ERR;
}
}
int main(void) {
puts("!!!Hello World!!!"); /* prints !!!Hello World!!! */
char *p = "............S**P";
SSavep(p, 6, 4, 4);
return EXIT_SUCCESS;
}