Data-structure-and-algorithm/Maze2.cpp at master · dyq-w/Data-structure-and-algorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include<iostream>
using namespace std;

#define M 4
#define N 4
#define MaxSize 999

int mg[M+2][N+2]=
{
    {1,1,1,1,1,1},
    {1,0,0,0,1,1},
    {1,0,1,0,0,1},
    {1,0,0,0,1,1},
    {1,1,0,0,0,1},
    {1,1,1,1,1,1},
};
int count=0;

typedef struct
{
    int i;
    int j;
}Box;
typedef struct
{
    Box data[MaxSize];
    int length;
}PathType;

void mgpath(int xi,int yi,int xe,int ye,PathType path)
{
    int di,k,i,j;
    if(xi==xe&&yi==ye)
    {
        path.data[path.length].i=xi;
        path.data[path.length].j=yi;
        path.length++;
        printf("迷宫路径%d如下：\n",++count);
        for(k=0;k<path.length;k++)
        {
            printf("\t(%d,%d)",path.data[k].i,path.data[k].j);
            if((k+1)%5==0)
                printf("\n");
        }
        printf("\n");
    }
    else
    {
        if(mg[xi][yi]==0){
            di=0;
            while(di<4)
            {
                switch(di)
                {
                    case 0:i=xi-1;j=yi;break;
                    case 1:i=xi;j=yi+1;break;
                    case 2:i=xi+1;j=yi;break;
                    case 3:i=xi;j=yi-1;break;
                }
                path.data[path.length].i=xi;
                path.data[path.length].j=yi;
                path.length++;
                mg[xi][yi]=-1;
                mgpath(i,j,xe,ye,path);
                path.length--;
                mg[xi][yi]=0;
                di++;
            }
        }
    }
}


int main()
{
    PathType path;
    path.length=0;
    mgpath(1,1,4,4,path);
    return 0;
}