[ 백준 11403 ] 경로찾기 (C++)

#include<iostream>
#include<cstring>
#include<queue>
 
#define endl "\n"
#define MAX 100
using namespace std;
 
int N;
int MAP[MAX][MAX];
int Answer[MAX][MAX];
bool BFS_Visit[MAX];
bool DFS_Visit[MAX][MAX];
 
void Input()
{
    cin >> N;
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            cin >> MAP[i][j];
        }
    }
}
 
void BFS(int a)
{
    queue<int> Q;
    Q.push(a);
    while (Q.empty() == 0)
    {
        int P = Q.front();
        Q.pop();
 
        for (int i = 0; i < N; i++)
        {
            if (MAP[P][i] == 1 && BFS_Visit[i] == false)
            {
                Q.push(i);
                BFS_Visit[i] = true;
                Answer[a][i] = 1;
            }
        }
    }
}
 
void DFS(int Point, int x, int y)
{
    DFS_Visit[Point][y] = true;
    Answer[Point][y] = 1;
 
    for (int i = 0; i < N; i++)
    {
        if (DFS_Visit[Point][i] == false && MAP[y][i] == 1)
        {
            DFS(Point, y, i);
        }
    }
 
}
 
void Solution()
{
    //##########################################################################
    // DFS Ver.
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        {
            if (DFS_Visit[i][j] == false && MAP[i][j] == 1)
            {
                DFS(i, i, j);
            }
        }
    }
    //##########################################################################
 
    //for (int i = 0; i < N; i++)
    //{
    //    BFS(i);
    //    memset(BFS_Visit, false, sizeof(BFS_Visit));
    //}
 
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < N; j++)
        { 
            cout << Answer[i][j] << " ";
        }
        cout << endl;
    }
}
 
void Solve()
{
    Input();
    Solution();
}
 
int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
 
    //freopen("Input.txt", "r", stdin);
    Solve();
 
    return 0;
}