[백준] 1260번 DFS와 BFS

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

1260번: DFS와 BFS

 

 

 

 

 

import java.util.*;

class Main {
  static int n, m, v;
  static int connect[][];
  static boolean visited[];
  
  public static void dfs(int i) {
    visited[i] = true;
    System.out.print(i + " ");
    
    for(int j = 1; j <= n; j++) {
      if(connect[i][j] == 1 && visited[j] == false) {
        dfs(j);
      }
    }
  }
    
  public static void bfs(){
    Queue<Integer> queue = new LinkedList<Integer>();
    queue.offer(v);
    visited[v] = true;
    System.out.print(v + " ");

    while(!queue.isEmpty()){
      int q = queue.poll();

      for(int i = 1; i <= n; i++){
        if(visited[i]==false && connect[i][q]==1){
          queue.offer(i);
          visited[i] = true;
          System.out.print(i + " ");
        }
      }
    }
  }

    
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    n = sc.nextInt();
    m = sc.nextInt();
    v = sc.nextInt();
    
    connect = new int[n+1][n+1];
    visited = new boolean[n+1];

    for(int i = 1; i <= m; i++){
      int x = sc.nextInt();
      int y = sc.nextInt();
      connect[x][y] = connect[y][x] = 1;
    }
         
    dfs(v);
         
    visited = new boolean[n+1]; 
    System.out.println(); 

    bfs();   
  }
}