BFS 거리 구하기 팁

package test;

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

public class Test03_BFS_dist {
	static int N;
	static boolean[] visited;
	static int[][] map;
	static void bfs(int start) {
		Queue<Integer> q = new LinkedList<>();
		
		q.add(start);
		visited[start] = true;
		
		int dist = 0;
		while(!q.isEmpty()) {
			int size = q.size();
			
			for(int s = 0; s < size; s++) {
				int now = q.poll();
				
				for(int i = 1; i <= N; i++) {
					if(map[now][i]==1 && !visited[i]) {
						q.add(i);
						visited[i] = true;
					}
				}
			}
			
			dist++;
		}
		
	}
}