图的深度遍历与广度遍历实例

package com.ceair.flight.refund.service.cronjob.impl;

import java.util.LinkedList;

public class Solution {
    public static void main(String[] args) {
        Graph graph = new Graph(6);

        graph.adj[0].add(1);
        graph.adj[0].add(2);
        graph.adj[0].add(3);

        graph.adj[1].add(0);
        graph.adj[1].add(3);
        graph.adj[1].add(4);

        graph.adj[2].add(0);

        graph.adj[3].add(0);
        graph.adj[3].add(1);
        graph.adj[3].add(4);
        graph.adj[3].add(5);

        graph.adj[4].add(1);
        graph.adj[4].add(3);
        graph.adj[4].add(5);

        graph.adj[5].add(3);
        graph.adj[5].add(4);


        System.out.println("图的深度优先遍历：");
        dfs(graph, 0, new boolean[graph.size]);

        System.out.println("图的广度优先遍历：");
        bfs(graph, 0, new boolean[graph.size], new LinkedList<Integer>());

    }

    /**
     * 图的顶点
     */
    private static class Vertex{
        int data;

        Vertex(int data) {
            this.data = data;
        }
    }

    /**
     * 图（邻接表形式）
     */
    private static class Graph{
        private int size;
        private Vertex[] vertexes;
        private LinkedList<Integer> adj[];

        Graph(int size) {
            this.size = size;
            // 初始化顶点和邻接矩阵
            vertexes = new Vertex[size];
            adj = new LinkedList[size];
            for (int i = 0; i < size; i++) {
                vertexes[i] = new Vertex(i);
                adj[i] = new LinkedList<>();
            }
        }
    }

    /**
     * 深度优先遍历
     */
    public static void dfs (Graph graph,int start,boolean[] visited){
        System.out.println(graph.vertexes[start].data);
        visited[start] = true;
        for (int index : graph.adj[start]) {
            if (!visited[index]) {
                dfs(graph, index, visited);
            }
        }
    }

    public static void bfs(Graph graph, int start, boolean[] visited, LinkedList<Integer> queue) {
        queue.offer(start);
        while (!queue.isEmpty()) {
            int front = queue.poll();
            if (visited[front]) {
                continue;
            }
            System.out.println(graph.vertexes[front].data);
            visited[front] = true;
            for (int index : graph.adj[front]) {
                queue.offer(index);
            }
        }
    }
}

　图的存储结构采用邻接表