백준 2606 그래프문제 C++

https://www.acmicpc.net/problem/2606

 

그냥 dfs로 순회했다.

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>

using namespace std;

vector<int> graph[101];
bool visited[101] = { 0, };
int v, n;
int sum = 0;

void dfs(int i) {

	visited[i] = true;

	for (int k : graph[i]) {
		if (visited[k] == false) {
			dfs(k);
			sum++;
		}
	}

}

int main() {

	

	cin >> v >> n;

	for (int i = 0; i < n; i++) {
		int temp1, temp2;
		cin >> temp1 >> temp2;
		graph[temp1].push_back(temp2);
		graph[temp2].push_back(temp1);
		
	}

	dfs(1);

	cout << sum << '\n';
	return 0;

}