数据结构之用DFS判断连通分量

最新推荐文章于 2024-04-26 21:32:04 发布

LANGZHIZHEN

最新推荐文章于 2024-04-26 21:32:04 发布

阅读量197

点赞数

分类专栏： Java数据结构与算法文章标签：数据结构算法 java dfs

本文链接：https://blog.csdn.net/weixin_48469642/article/details/120849308

版权

Java数据结构与算法专栏收录该内容

9 篇文章 0 订阅

订阅专栏

package AizuOJ.Graph;

import java.util.Scanner;

/****
 * int[] find is to determine whether this point is repeated
 * AdjGraph G is Graph which records the information of points
 * Node is a node and its contents
 * union() is to determine whether the two points are connected by DFS
 * add() is to add two information of point in Graph
 */
public class ConnectedComponents {
    static class AdjGraph{ //
        static class Node{
            Node next;
            int val;

            public Node() {
                val = -1;
                next = null;
            }
        }

        public Node[] vertex;
        public AdjGraph(int Num){
            vertex = new Node[Num];
            for(int i =0;i<Num;i++)
            {
                vertex[i] = new Node();
                vertex[i].val = i;
            }
        }
        public void add(int x,int y){
            Node node = vertex[x].next;
            node = new Node();
            node.val = y;
            node.next = vertex[x].next;
            vertex[x].next = node;
        }
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int N = in.nextInt();
        AdjGraph G = new AdjGraph(N);
        int M = in.nextInt();
        int[] find = new int[N];
        for(int i=0;i<M;i++)
        {
            int x,y;
            x = in.nextInt();
            y = in.nextInt();
            G.add(x,y);
        }
        int Q = in.nextInt();
        for(int i=0;i<Q;i++)
        {
            int x,y;
            x = in.nextInt();
            y = in.nextInt();
            if(union(x,y,find,G,N))
                System.out.println("yes");
            else
                System.out.println("no");
        }
    }

    private static boolean union(int s, int d,int[] find,AdjGraph G,int N) {
        boolean flag = false;
        if(G.vertex[s] == null)
            return false;
        AdjGraph.Node node = G.vertex[s];
        while(node != null){
            if(node.val == d)
                return true;
            else if(find[node.val] != 1)
            {
                find[node.val] = 1;
                flag = union(node.val,d,find,G,N);
                find[node.val] = 0;
                if(flag)
                    return true;
            }
            node = node.next;
        }
        return false;
    }

}