백준 1260번: DFS와 BFS

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
 
public class algo2_1260_dfs_bfs {
    
    private static int N;
    private static int M;
    private static int V;
    private static int[][] W;
    private static boolean[] visit;
    
    public static void main(String[] args) {
    
        Scanner scanner = new Scanner(System.in);
        N = scanner.nextInt();
        M = scanner.nextInt();
        V = scanner.nextInt();
        W = new int[N+1][N+1];
        visit = new boolean[N+1];
        
        for(int i=0 ; i<M ; i++){
            int N1 = scanner.nextInt();
            int N2 = scanner.nextInt();
            W[N1][N2] = 1;
            W[N2][N1] = 1;
        }
        scanner.close();
        
        dfs(V);
        
        System.out.print("\n");
        for(int i=0 ; i<visit.length ; i++)
            visit[i] = false;
    
        bfs(V);
    }
    
    public static void dfs(int num){
        
        System.out.print(num + " ");
        visit[num] = true;
        
        for(int i=1 ; i<=N ; i++){
            if(W[num][i]==1 && !visit[i])
                dfs(i);
        }    
    }
    
    public static void bfs(int num){
        
        Queue<Integer> queue = new LinkedList<>();
        
        queue.offer(num);
        visit[num] = true;
        
        while(!queue.isEmpty()){
            int front = (int)queue.peek();
            queue.poll();
            
            System.out.print(front + " ");
            
            for(int i=1 ; i<=N ; i++){
                if(W[front][i]==1 && !visit[i]){
                    queue.offer(i);
                    visit[i] = true;
                }
            }
        }
    }
}