[Algorithm] 백준 알고리즘 1260 (DFS와 BFS)

 

 

java 코드

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class Main {
	
	static int n;
	static int m;
	static int v;
    
	static int map[][];
	static boolean visit[];
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		m = sc.nextInt();
		v = sc.nextInt();
		
		map = new int[n+1][n+1];
		visit = new boolean[n+1];
		
		for(int i=0; i<m; i++) {
			int x = sc.nextInt();
			int y = sc.nextInt();
			map[x][y] = map[y][x] = 1;
		}
		
		dfs(v);
		resetVisit();
		bfs(v);
	}
    
	static void dfs(int s) {
		visit[s]=true;
		System.out.print(s+" ");
		for(int i=1; i<=n; i++) {
			if(map[s][i]==1 && !visit[i]) {
				dfs(i);
			}
		}
		
	}
	
	static void resetVisit() {
		for(int i=1; i<=n; i++) {
			visit[i]=false;
		}
		System.out.println("");
	}
    
	static void bfs(int s) {
		Queue<Integer> q = new LinkedList<Integer>();
		q.add(s);
		visit[s]=true;
		while(!q.isEmpty()) {
		int t = q.poll();
		System.out.print(t+" ");
			for(int i=1; i<=n; i++) {
				if(map[t][i]==1&&!visit[i]) {
					visit[i]=true;
					q.add(i);
				}
			}
		}
	}
	
}