HDU 1869 ( 六度分离 ) （Floyd）

Problem

Floyd算法，如果任何两个人的距离大于了7，六度理论即不成立，多源汇最短路径裸题。

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;

class Main {
    static Scanner sn = new Scanner(System.in);
    static int N = 110, M = 210, n, m;
    static int dist[][];
    static final int INF = 0x3f3f3f3f;

    public static void init() {
        dist = new int[N][N];
        for (int i = 0; i < N; i++)
            for (int j = 0; j < N; j++)
                dist[i][j] = INF;
    }

    public static void main(String[] args) throws IOException {

        while (sn.hasNext()) {
            n = sn.nextInt();
            m = sn.nextInt();
            init();
            for (int i = 0; i < m; i++) {
                int a = sn.nextInt();
                int b = sn.nextInt();
                dist[a][b] = dist[b][a] = 1;
            }

            Floyd();
            boolean flag = false;
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++)
                    if (dist[i][j] > 7)
                        flag = true;
            }

            if (flag) System.out.println("No");
            else System.out.println("Yes");

        }
    }

    public static void Floyd() {
        for (int k = 0; k < n; k++) {
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < n; j++) {
                    dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
                }
            }
        }
    }


}