//============================================================================
// Name : DFS.cpp
// Author : judyge
// Version :
// Copyright : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================
#include<stdio.h>
typedef struct point
{
int row, col;
} item_t;
#define MAX_ROW 5
#define MAX_COL 5
static item_t stack[512];
static int top = 0;
void push(item_t p)
{
stack[top++] = p;
}
item_t pop(void)
{
return stack[--top];
}
int is_empty(void)
{
return top == 0;
}
int maze[MAX_ROW][MAX_COL] =
{
0, 1, 0, 0, 0,
0, 1, 0, 1, 0,
0, 0, 0, 0, 0,
0, 1, 1, 1, 0,
0, 0, 0, 1, 0,
};
void print_maze(void)
{
int i, j;
for (i = 0; i < MAX_ROW; i++)
{
for (j = 0; j < MAX_COL; j++)
printf("%d ", maze[i][j]);
putchar('n');
}
printf("*********n");
}
struct point predecessor[MAX_ROW][MAX_COL] =
{
{{ -1, -1}, { -1, -1}, { -1, -1}, { -1, -1}, { -1, -1}},
{{ -1, -1}, { -1, -1}, { -1, -1}, { -1, -1}, { -1, -1}},
{{ -1, -1}, { -1, -1}, { -1, -1}, { -1, -1}, { -1, -1}},
{{ -1, -1}, { -1, -1}, { -1, -1}, { -1, -1}, { -1, -1}},
{{ -1, -1}, { -1, -1}, { -1, -1}, { -1, -1}, { -1, -1}},
};
void visit(int row, int col, struct point pre)
{
struct point visit_point = { row, col };
maze[row][col] = 2;
predecessor[row][col] = pre;
push(visit_point);
}
int main(void)
{
struct point p = { 0, 0 };
maze[p.row][p.col] = 2;
push(p);
while (!is_empty())
{
p = pop();
if (p.row == MAX_ROW - 1 /* goal */
&& p.col == MAX_COL - 1)
break;
if (p.col + 1 < MAX_COL
/* right */
&& maze[p.row][p.col + 1] == 0)
visit(p.row, p.col + 1, p);
if (p.row + 1 < MAX_ROW
/* down */
&& maze[p.row + 1][p.col] == 0)
visit(p.row + 1, p.col, p);
if (p.col - 1 >= 0
/* left */
&& maze[p.row][p.col - 1] == 0)
visit(p.row, p.col - 1, p);
if (p.row - 1 >= 0
/* up */
&& maze[p.row - 1][p.col] == 0)
visit(p.row - 1, p.col, p);
print_maze();
}
if (p.row == MAX_ROW - 1 && p.col == MAX_COL - 1)
{
printf("(%d, %d)n", p.row, p.col);
while (predecessor[p.row][p.col].row != -1)
{
p = predecessor[p.row][p.col];
printf("(%d, %d)n", p.row, p.col);
}
}
else
printf("No path!n");
return 0;
}
递归法
#include<stdio.h>
const int di[4] = {0,1,0,-1},
dj[4] = {1,0,-1,0};
unsigned maze[5][5] = {
2, 1, 0, 0, 0,
0, 1, 0, 1, 0,
0, 0, 0, 0, 0,
0, 1, 1, 1, 0,
0, 0, 0, 1, 0},
ip = 0;
struct { int i, j; } path[23] = {0};
void print_maze(void)
{
int i, j;
for (i = 0; i < 5; i++) {
for (j = 0; j < 5; j++)
printf("%d ", maze[i][j]);
putchar('\n');
}
printf("*********\n");
}
void print_path(void)
{
int i = 0;
printf("(0,0)");
for (i = 0; i < ip; i++)
printf("->(%d,%d)", path[i].i, path[i].j);
exit(0);
}
void try(int i, int j)
{
int k;
for (k = 0; k < 4; k++)
if (i + di[k] >= 0 && i + di[k] <5
&& j + dj[k] >= 0 && j + dj[k] < 5
&& maze[i + di[k]][j + dj[k]] == 0) {
maze[i + di[k]][j + dj[k]] = 2;
path[ip++].i = i + di[k]; path[ip].j = j + dj[k];
print_maze();
if (i + di[k] == 4 && j + dj[k] == 4)
print_path();
else
try(i + di[k], j + dj[k]);
maze[i+di[k]][j+dj[k]] = 0;
path[--ip].i = 0; path[ip].j = 0;
}
}
int main(void)
{
try(0, 0);
return 0;
}