无向图的深度优先搜索和广度优先搜索

2019独角兽企业重金招聘Python工程师标准>>>

无向图模型

无向图的深度优先搜索和广度优先搜索

public class TestA {

    public static void main(String[] args) {

        TestA a = new TestA();
        a.dfs(0);
        a.bfs(1);

    }

    int[][] edge = { { 0, 1, 1, -1, -1 }, { 1, 0, -1, 1, 1 }, { 1, -1, 0, -1, 1 }, { -1, 1, -1, 0, -1 },
            { -1, 1, 1, -1, 0 } };
    String[] vertex = { "A", "B", "C", "D", "E" };

    Stack<Integer> stack = new Stack<>();
    int[] book = new int[5];

    void dfs(int cur) {

        book[cur] = 1;
        System.out.println("--- " + vertex[cur] + " ---");

        for (int i = 0; i < edge.length; i++) {
            if (edge[cur][i] == 1 && book[i] == 0) {
                dfs(i);
            }
        }
    }

    void bfs(int start) {

        System.out.println("#######");
        book = new int[5];
        stack.push(start);
        while (!stack.isEmpty()) {
            int cur = stack.pop();//从top[队尾]取出数据并删除
            book[cur] = 1;

            System.out.println("--- " + vertex[cur] + " ---");
            for (int i = 0; i < edge.length; i++) {

                if (edge[cur][i] == 1 && book[i] == 0) {
                    stack.push(i);//向top[队尾]追加数据
                }
            }
        }
    }
}

输出结果

--- A ---
--- B ---
--- D ---
--- E ---
--- C ---
#######
--- B ---
--- E ---
--- C ---
--- A ---
--- D ---
--- A ---

转载于:https://my.oschina.net/u/3706181/blog/1596251