BOJ_1389 : 케빈 베이컨의 6단계 법칙(플로이드)

Author: spring0913

week7/BOJ_1389(케빈 베이컨의 6단계 법칙).java

@@ -0,0 +1,52 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st = new StringTokenizer(br.readLine());
+        int N = Integer.parseInt(st.nextToken());
+        int M = Integer.parseInt(st.nextToken());
+        int[][] graph = new int[N+1][N+1];
+
+        for(int i=1; i<=N; i++) {
+            for(int j=1; j<=N; j++) {
+                if(i == j) {
+                    graph[i][j] = 0;
+                }else {
+                    graph[i][j] = 1000;
+                }
+            }
+        }
+
+        for(int i=0; i<M; i++) {
+            st = new StringTokenizer(br.readLine());
+            int A = Integer.parseInt(st.nextToken());
+            int B = Integer.parseInt(st.nextToken());
+            graph[A][B] = graph[B][A] = 1;
+        }
+
+        for(int k=1; k<=N; k++) {
+            for(int i=1; i<=N; i++) {
+                for(int j=1; j<=N; j++) {
+                    graph[i][j] = Math.min(graph[i][j], graph[i][k] + graph[k][j]);
+                }
+            }
+        }
+
+        int[] count = new int[N+1];
+        for(int i=1; i<=N; i++) {
+            for(int j=1; j<=N; j++) {
+                count[i] += graph[i][j];
+            }
+        }
+        int answer = 1;
+        for(int i=1; i<=N; i++) {
+            if(count[answer] > count[i]) {
+                answer = i;
+            }
+        }
+        System.out.println(answer);
+    }
+}