【alg4-无环图】使用深度优先搜索检测环

最新推荐文章于 2024-05-18 05:30:00 发布

RB_VER

最新推荐文章于 2024-05-18 05:30:00 发布

阅读量134

点赞数

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/qq_41242680/article/details/110873254

版权

图算法深度优先搜索 Java 环检测图结构

关键词由CSDN通过智能技术生成

算法专栏收录该内容

42 篇文章 2 订阅

订阅专栏

代码

其中图用到了Graph：

package section4_1;

public class Cycle {

    private boolean[] marked;
    private boolean hasCycle;

    public Cycle(Graph G) {
        marked = new boolean[G.V()];
        for (int s = 0;s < G.V();s++) {
            if (!marked[s]) {
                dfs(G,s,s);
            }
        }
    }

    private void dfs(Graph G,int v, int u) {
        marked[v] = true;
        for (int w : G.adj(v)) {
            if (!marked[w]) dfs(G,w,v);//将一个结点和它的邻接结点继续递归
            else if (w != u) hasCycle = true;//如果已经访问过的邻接结点的邻接结点不是该结点，则说明有环。
        }
    }

    public boolean hasCycle() {
        return hasCycle;
    }

    public static void main(String[] args) {
        //有环图
        int[][] data1 = {
                {0,5},
                {2,4},
                {2,3},
                {1,2},
                {0,1},
                {3,4},
                {3,5},
                {0,2}
        };
        int vn = 6;
        int e = 8;
        Graph graph1 = new Graph(vn,e,data1);
        Cycle cycle1 = new Cycle(graph1);
        System.out.println(cycle1.hasCycle());

        //无环图
        int[][] data2 = {
                {0,1},
                {0,2},
                {0,3}
        };
        int vn2 = 4;
        int e2 = 3;
        Graph graph2 = new Graph(vn2,e2,data2);
        Cycle cycle2 = new Cycle(graph2);
        System.out.println(cycle2.hasCycle());
    }
}