DFS

dfs.cpp

#include <iostream>

using namespace std;

int n, m;
bool vector[100][100];
bool visited[100];

void dfs(int point){
	cout << (point + 1);
	visited[point] = true;
	for (int j = 0; j < n; j++){
		if (!visited[j] && vector[point][j]){
			dfs(j);
		}
	}
}

int main(){
	cin >> n >> m;
	for (int i = 0; i < m; i++){
		int x, y;
		cin >> x >> y;
		vector[x - 1][y - 1] = true;
		vector[y - 1][x - 1] = true;
	}
	for (int i = 0; i < n; i++){
		if (!visited[i]){
			dfs(i);
		}
	}
	return 0;
}