Java 通信网络

package test;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Scanner;

public class Main {
    static LinkedList<LinkedList<Integer>> arr = new LinkedList<LinkedList<Integer>>();

    static int num = 0;
    public static int iscorrect[][] = new int[1024][1024];
    public static void dfsSlove(int u,int visit[], int cur){
        visit[u] = 1;
        iscorrect[u][cur] = iscorrect[cur][u] = 1;
        for(Integer a : arr.get(u)){
            if(visit[a]==0){
                dfsSlove(a , visit, cur);
            }
        }
    }
    public static void main(String args[]){
        Scanner in = new Scanner(System.in 

);
        int n = in.nextInt();
        int m = in.nextInt();
        for(int i=0;i<=n;i++){
            arr.add(new LinkedList());
        }
        for(int i=0;i<m;i++){
            int a = in.nextInt();
            int b = in.nextInt();
            arr.get(a).addLast(b);
        }
        for(int i=1;i<=n;i++){
            int visit[] = new int[1024];
            Arrays.fill(visit, 0);
            dfsSlove(i,visit,i);
        }
        for(int i=1;i<=n;i++){
            int j;
            for(j=1;j<=n;j++){
                if(iscorrect[i][j]==0){             
                    break;
                }
            }
            if(j==n+1){
                num = num+1;
            }
        }
        System.out.println(num);
    }
}