[JAVA/백준] BFS: 경로 찾기

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

/**
 * @author HEESOO
 *
 */
public class Main {
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		int n=scan.nextInt();
		int[][] map=new int[n][n];
		int[][] answer=new int[n][n];
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
				map[i][j]=scan.nextInt();
		
		Queue<Integer> q=new LinkedList<>();
		for(int i=0;i<n;i++) {
			boolean[] visit=new boolean[n];
			for(int j=0;j<n;j++) {
				if(map[i][j]==1) {
					q.offer(j);
				}
			}
			while(!q.isEmpty()) {
				int temp=q.poll();
				visit[temp]=true;
				answer[i][temp]=1;
				for(int j=0;j<n;j++) {
					if(map[temp][j]==1&&map[i][j]!=1&&!visit[j]) q.offer(j);
				}
			}
		}
		
		for(int i=0;i<n;i++) {
			for(int j=0;j<n;j++) {
				System.out.print(answer[i][j]+" ");
			}
			System.out.println();
		}
	}
}