백준 11403번 경로 찾기 C++

출처 : https://www.acmicpc.net/problem/11403

 

dfs로 그래프를 탐색해서 문제를 해결하였다.

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>

using namespace std;
using ll = long long;

int n;
vector<vector<int>> graph(101, vector<int>());
vector<bool> visited(101, false);

void Print() {
	for (int i = 1; i <= n; i++) {
		if (visited[i]) cout << 1 << " ";
		else cout << 0 << " ";
	}
	cout << "\n";
}

void RefreshVisited() {
	for (int i = 1; i <= n; i++) {
		visited[i] = false;
	}
}

void Dfs(int n) {
	for (auto a : graph[n]) {
		if (visited[a]) continue;
		visited[a] = true;
		Dfs(a);
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	cin >> n;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			int input;
			cin >> input;
			if (input == 0) continue;
			graph[i].push_back(j);
		}
	}
	for (int i = 1; i <= n; i++) {
		RefreshVisited();
		Dfs(i);
		Print();
	}
};