迷宫-dfs，bfs

#include<iostream>
using namespace std;
void bfs(int i1, int j1, int i2, int j2);
void deep(int i1, int j1,int i2,int j2);
bool dfs(int i, int j, int i2, int j2);
int dfs_f[10][10] = { 0 };
int g[10][10] = {
    {1,1,1,1,1,1,1,1,1,1},
    {1,0,0,1,0,0,0,1,0,1},
    {1,0,0,1,0,0,0,1,0,1},
    {1,0,0,0,0,1,1,0,0,1},
    {1,0,1,1,1,0,0,0,0,1},
    {1,0,0,0,1,0,0,0,0,1},
    {1,0,1,0,0,0,1,0,0,1},
    {1,0,1,1,1,0,1,1,0,1},
    {1,1,0,0,0,0,0,0,0,1},
    {1,1,1,1,1,1,1,1,1,1} };
struct node
{
    int i, j;
    int pre;
};
struct que
{
    struct node s[100];
    int r, f;
};
struct Stack
{
    int s[100];
    int top;
};
struct dfs_stack
{
    struct node s[100];
    int top;
}dfs_s;
int main()
{
    cout << "迷宫图：" << endl;
    for (int i = 0; i < 10; i++)
    {
        for (int j = 0; j < 10; j++)
        {
            cout << g[i][j] << ' ';
        }
        cout << endl;
    }

    while (1)
    {
        int s_i, s_j, e_i, e_j;
        cout << "起点i：";
        cin >> s_i;
        cout << "起点j：";
        cin >> s_j;
        cout << "终点i：";
        cin >> e_i;
        cout << "终点j：";
        cin >> e_j;

            cout << "BFS: ";
            bfs(s_i,s_j,e_i,e_j);
            cout << endl;
            cout << "DFS: ";
            deep(s_i, s_j, e_i, e_j);
            cout << endl << endl;

    }
    return 0;
}
bool dfs(int i, int j, int i2,int j2)
{

    if (i == i2 && j == j2)
    {
        struct node* p = new struct node;
        p->i = i;
        p->j = j;
        dfs_s.s[++dfs_s.top] = *p;
        delete p;
        return true;
    }
    if (dfs_f[i + 1][j] == 0 && g[i + 1][j] == 0)
    {
        dfs_f[i + 1][j] = 1;
        if (dfs(i + 1, j, i2, j2))
        {
            struct node* p = new struct node;
            p->i = i;
            p->j = j;
            dfs_s.s[++dfs_s.top] = *p;
            delete p;
            return true;
        }
    }
    if (dfs_f[i][j + 1] == 0 && g[i][j + 1] == 0)
    {
        dfs_f[i][j + 1] = 1;
        if (dfs(i, j + 1, i2, j2))
        {
            struct node* p = new struct node;
            p->i = i;
            p->j = j;
            dfs_s.s[++dfs_s.top] = *p;
            delete p;
            return true;
        }
    }
    if (dfs_f[i - 1][j] == 0 &&  g[i-1][j] == 0)
    {    
        dfs_f[i - 1][j] = 1;
        if (dfs(i - 1, j, i2, j2))
        {
            struct node* p = new struct node;
            p->i = i;
            p->j = j;
            dfs_s.s[++dfs_s.top] = *p;
            delete p;
            return true;
        }
    }
    if (dfs_f[i][j-1] == 0 && g[i][j-1] == 0)
    {
        dfs_f[i][j - 1] = 1;
        if (dfs(i, j - 1, i2, j2))
        {
            struct node* p = new struct node;
            p->i = i;
            p->j = j;
            dfs_s.s[++dfs_s.top] = *p;
            delete p;
            return true;
        }
    }
    return false;
}
void deep(int i1, int j1, int i2, int j2)
{
    dfs_s.top = -1;
    for (int i = 0; i < 10; i++)
        for (int j = 0; j < 10; j++)
            dfs_f[i][j] = 0;
    dfs(i1, j1, i2, j2);
    if (dfs_s.top == -1)
    {
        cout << "Error";
    }
    else
    {
        while (dfs_s.top != -1)
        {
            struct node* ptemp = &dfs_s.s[dfs_s.top--];
            cout << "(" << ptemp->i << "," << ptemp->j << ")";
            if (dfs_s.top != -1)
            {
                cout << "->";
            }
        }
        }

}

void bfs(int s_i, int s_j, int e_i, int e_j)
{
        int err_flag = 0;
        int f[10][10] = { 0 };//标记是否被访问过
        struct que q;
        q.r = q.f = -1;
        struct node* p = new struct node;
        p->i = s_i; // start    
        p->j = s_j;
        p->pre = -1;
        f[p->i][p->j] = 1;
        q.s[++q.f] = *p;
        while (q.r < q.f)
        {
            ++q.r;
            int i = q.s[q.r].i;
            int j = q.s[q.r].j;
            if (i == e_i && j == e_j)
            {
                break; //到达终点，退出循环
            }
            if (g[i][j - 1] == 0 && f[i][j - 1] == 0)
            {
                struct node* p = new struct node;
                p->i = i;
                p->j = j - 1;
                p->pre = q.r;
                f[i][j - 1] = 1;
                q.s[++q.f] = *p;
                delete p;
            }
            if (g[i - 1][j] == 0 && f[i - 1][j] == 0)
            {
                struct node* p = new struct node;
                p->i = i - 1;
                p->j = j;
                p->pre = q.r;
                f[i - 1][j] = 1;
                q.s[++q.f] = *p;
                delete p;
            }
            if (g[i][j + 1] == 0 && f[i][j + 1] == 0)
            {
                struct node* p = new struct node;
                p->i = i;
                p->j = j + 1;
                p->pre = q.r;
                f[i][j + 1] = 1;
                q.s[++q.f] = *p;
                delete p;
            }
            if (g[i + 1][j] == 0 && f[i + 1][j] == 0)
            {
                struct node* p = new struct node;
                p->i = i + 1;
                p->j = j;
                p->pre = q.r;
                f[i + 1][j] = 1;
                q.s[++q.f] = *p;
                delete p;
            }
        }
        Stack s;
        s.top = -1;
        s.s[++s.top] = q.r; // 终点入栈
        if (q.s[q.r].i != e_i || q.s[q.r].j != e_j)
        {
            cout << "Error";
        }
        else
        {
            struct node* p1 = &q.s[q.r];
            while (p1->pre != -1)
            {
                s.s[++s.top] = p1->pre;
                p1 = &q.s[p1->pre];
            }
            while (s.top != -1)
            {
                cout << "(" << q.s[s.s[s.top]].i << "," << q.s[s.s[s.top]].j << ")";
                if (s.top != 0)
                    cout << "->";
                s.top--;
            }
        }
}