깊이 우선 탐색 (DFS) // 재귀 사용

#include <iostream>
#include <vector>

using namespace std;
void dfs(int start,vector<vector <int>> &temp,vector<bool> &check) {
	cout << start << endl;
	check[start] = true;
	for (int i = 0; i < temp[start].size(); i++) {
		if (temp[start][i] == 1 && check[i] == false) {
			dfs(i, temp, check);
		}
	}
}
int main() {
	vector<vector<int>> temp = {
	{0,1,1,0,0,0,0},
	{1,0,1,1,1,0,0},
	{1,1,0,0,0,1,1},
	{0,1,0,0,1,0,0},
	{0,1,0,1,0,0,0},
	{0,0,1,0,0,0,1},
	{0,0,1,0,0,1,0}
	};
	for (int i = 0; i < temp.size(); i++) {
		for (int j = 0; j < temp[i].size(); j++) {
			cout << temp[i][j];
		}
		cout << endl;
	}
	vector <bool> check(temp.size(), false); // 방문한지 안한지
	dfs(0,temp,check);
	system("pause");
	return 0;
}

0110000
1011100
1100011
0100100
0101000
0010001
0010010
0
1
2
5
6
3
4

출처:https://blog.naver.com/PostView.nhn?blogId=ndb796&logNo=221230945092&categoryNo=128&parentCategoryNo=0&viewDate=¤tPage=6&postListTopCurrentPage=1&from=postList&userTopListOpen=true&userTopListCount=5&userTopListManageOpen=false&userTopListCurrentPage=6