[java] 백준 1260 : DFS와 BFS

문제

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

1260번: DFS와 BFS

 

 

코드

import java.util.*;

public class Main {
	static int N;
	static int M;
	static int K;
	static int X;
	static ArrayList<Integer>[] arr;
	static boolean[] visited;

	public static void main(String[] args) {
	
	Scanner sc = new Scanner(System.in);
	
	N = sc.nextInt();
	M = sc.nextInt();
	K = sc.nextInt();
	
	arr = new ArrayList[N+1];
	visited = new boolean[N+1];
	
	for(int i=1; i<=N; i++) {
		arr[i] = new ArrayList<Integer>();
	}
	
	for(int i=0; i<M; i++) {
		int a = sc.nextInt();
		int b = sc.nextInt();
		arr[a].add(b);
		arr[b].add(a);
	}
	
	
	for(int i=1; i<=N; i++) {
		Collections.sort(arr[i]);
	}
	
	
	DFS(K);
	System.out.println();
	
	visited = new boolean[N+1];
	BFS();
	
	
	
	}
	static void DFS(int n) {
		System.out.print(n+" ");
		visited[n]=true;
			for(int x : arr[n]) {
				if(visited[x]==false) {
				DFS(x);}
				
			}
		
	}
	

	static void BFS() {
		Queue<Integer> q = new LinkedList<>();
		q.add(K);
		visited[K]=true;
		
		while(!q.isEmpty()) {
			int now = q.poll();
			System.out.print(now+" ");
			for(int x : arr[now]) {
				if(visited[x]==false) {
					q.add(x);
					visited[x]=true;
				}
			}
		}
		
	}
}