[BOJ] 백준 1260 DFS와 BFS

 

 

[문제]

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

 

 

[소스 코드]

import java.io.*;
import java.util.*;

public class Main {
	static int n;
	static boolean[] visit;
	static boolean[][] edge;
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		n = Integer.parseInt(st.nextToken());
		int m = Integer.parseInt(st.nextToken());
		int v = Integer.parseInt(st.nextToken());
		edge = new boolean[n+1][n+1];
		for(int i=0;i<m;i++) {
			st = new StringTokenizer(br.readLine());
			int a = Integer.parseInt(st.nextToken());
			int b = Integer.parseInt(st.nextToken());
			edge[a][b] = edge[b][a] = true;
		}
		visit = new boolean[n+1];
		System.out.print(v+" ");
		dfs(v);
		System.out.println();
		bfs(v);
	}
	private static void dfs(int v) {
		visit[v] = true;
		for(int i=1;i<=n;i++) {
			if(edge[v][i] && !visit[i]) {
				System.out.print(i+" ");
				dfs(i);
			}
		}
	}
	private static void bfs(int v) {
		Queue<Integer> q = new LinkedList<>();
		visit = new boolean[n+1];
		q.offer(v);
		visit[v] = true;
		System.out.print(v+" ");
		while(!q.isEmpty()) {
			int curr = q.poll();
			for(int i=1;i<=n;i++) {
				if(edge[curr][i] && !visit[i]) {
					System.out.print(i+" ");
					visit[i] = true;
					q.offer(i);
				}
			}
		}
	}
}