BaekJoon-no.1260 DFS와 BFS

void dfs(int x){ 
	check[x] = true;
	printf("%d ",x);
	for(int i =0;i<v[x].size();i++){
		int y =v[x][i];
		if(check[y] == false)
			dfs(y);
	}   
}

void bfs(int x){ 
	queue<int> q;
	memset(check,false,sizeof(check));
	check[x] = true;
	q.push(x);

	while(!q.empty()) {
		int top = q.front();
		q.pop();
		printf("%d ",top);
		for(int i = 0;i<v[top].size();i++){
			int y = v[top][i];
			if(check[y] == false)
			{
				check[y] = true;
				q.push(y);
			}
		}
	}   
}