[Graph] programmers 가장 먼 노드

Author: Seogeurim

README.md

@@ -285,6 +285,7 @@
 | 07  |     | [JUNGOL-1863 종교](./src/Graph/jo1863)                  | union-find : union-by-rank |
 | 08  |     | [Baekjoon-21276 계보 복원가 호석](./src/Graph/P21276)      | [위상정렬](./notes/Graph/TopologicalSort.md) |
 | 09  | ⭐️  | [Baekjoon-2458 키 순서](./src/Graph/P2458)               |                  |
+| 10  |     | [Programmers 가장 먼 노드](./src/Graph/prg49189)          |      |
 
 ### Minimum Spanning Tree (MST)
 

src/Graph/prg49189/README.md

@@ -0,0 +1,3 @@
+## [programmers - 그래프] 가장 먼 노드
+
+![image](https://user-images.githubusercontent.com/22045163/116100368-ce13ea80-a6e7-11eb-9309-04ad089d34ca.png)

src/Graph/prg49189/Solution.java

@@ -0,0 +1,46 @@
+package Graph.prg49189;
+
+import java.util.*;
+
+class Solution {
+
+    LinkedList<Integer>[] graph;
+
+    public int solution(int n, int[][] edge) {
+
+        graph = new LinkedList[n+1];
+        for (int i = 1; i <= n; i++) graph[i] = new LinkedList<>();
+
+        for (int[] e : edge) {
+            graph[e[0]].add(e[1]);
+            graph[e[1]].add(e[0]);
+        }
+
+        return bfs(n);
+    }
+
+    int bfs(int n) {
+
+        Queue<Integer> q = new LinkedList<>();
+        boolean[] visited = new boolean[n+1];
+        q.offer(1);
+        visited[1] = true;
+
+        int curSize = 0;
+
+        while (!q.isEmpty()) {
+            curSize = q.size();
+            for (int i = 0; i < curSize; i++) {
+                int cur = q.poll();
+                for (int next : graph[cur]) {
+                    if (!visited[next]) {
+                        visited[next] = true;
+                        q.offer(next);
+                    }
+                }
+            }
+        }
+
+        return curSize;
+    }
+}