華為機試-最長廣播響應

package main;

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

public class test18 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();//節點數量
        int m = in.nextInt();//消息序列長度
        int[][] nums = new int[n + 1][n + 1];
        boolean[] visited = new boolean[n + 1];
        int ans = 0;
        for (int i = 0; i < m; i++) {
            int a = in.nextInt();
            int b = in.nextInt();
            nums[a][b] = 1;
            nums[b][a] = 1;
        }
        for (int i = 1; i < n + 1; i++) {
            nums[i][i] = 1;
        }
        int start = in.nextInt();
        Queue<Integer> queue = new LinkedList<>();
        queue.offer(start);
        visited[start] = true;
        while(!queue.isEmpty()){
            if(check(visited)){
                break;
            }
            ans += 1;
            int size = queue.size();
            for (int i = 0; i < size; i++) {
                int k = queue.poll();
                System.out.print("k = " + k + " ");
                for (int j = 1; j < n + 1; j++) {
                    if(visited[j] == false && nums[k][j] == 1){
                        queue.offer(j);
                        visited[j] = true;
                    }
                }
            }
            
        }
        System.out.println(ans * 2);
       
    }
    public static boolean check(boolean[] visited){
        for (int i = 1; i < visited.length; i++) {
            if(visited[i] == false){
                return false;
            }
        }
        return true;
    }
}