BEAKJOON JAVA ALGORITHM #1260(DFS와 BFS)

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

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.LinkedList; import java.util.Queue; import java.util.Stack; import java.util.StringTokenizer; public class a1260 { public static void main(String[] args) throws IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); StringTokenizer token=new StringTokenizer(br.readLine()); int n=Integer.parseInt(token.nextToken()); //정점개수 int m=Integer.parseInt(token.nextToken()); //간선개수 int v=Integer.parseInt(token.nextToken()); //시작점 int[][] arr=new int[n+1][n+1]; boolean[] boo=new boolean[n+1]; for(int i=0;i<m;i++){ token=new StringTokenizer(br.readLine()); int p=Integer.parseInt(token.nextToken()); int q=Integer.parseInt(token.nextToken()); arr[p][q]=arr[q][p]=1; } dfs(arr,v,boo); System.out.println(); for(int i=0;i<arr.length;i++){ boo[i]=false; } bfs(arr,v,boo); } public static void dfs(int[][] arr, int v, boolean[] boo) { Stack<Integer> s=new Stack<>(); boolean flag; s.push(v); boo[v]=true; System.out.print(v+" "); while(!s.isEmpty()){ int vv=s.peek(); flag=false; for(int i=1;i<=arr.length-1;i++){ if(arr[vv][i]==1 && !boo[i]){ s.push(i); System.out.print(i+" "); boo[i]=true; flag=true; break; } } if(!flag){ s.pop(); } } } private static void bfs(int[][] arr, int v, boolean[] boo) { Queue<Integer> q=new LinkedList<>(); q.add(v); boo[v]=true; while(!q.isEmpty()){ v=q.poll(); System.out.print(v+" "); for(int i=1;i<=arr.length-1;i++){ if(arr[v][i]==1 && !boo[i]){ q.add(i); boo[i]=true; } } } } }