图的深度优先和广度优先遍历

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

public class GraphDemo {

    private ArrayList<String> vertexList;   //存储顶点的集合
    private int[][] edges;
    private int numOfEdges;
    private boolean[] hasVisited;

    public static void main(String[] args) {
        String[] vertex = {"A", "B", "C", "D", "E", "F", "G", "H"};
        int len = vertex.length;
        GraphDemo graph = new GraphDemo(len);
        //添加顶点
        for (int i = 0; i < len; i++) {
            graph.insertVertex(vertex[i]);
        }
        //添加边
        /*
                                A
                               / \
                              /   \
                             B     C
                            / \   / \
                           D   E  F--G
                            \ /
                             H
         */                  
        graph.insertEdges(0, 1, 1);
        graph.insertEdges(0, 2, 1);
        graph.insertEdges(1, 3, 1);
        graph.insertEdges(1, 4, 1);
        graph.insertEdges(3, 7, 1);
        graph.insertEdges(4, 7, 1);
        graph.insertEdges(2, 5, 1);
        graph.insertEdges(2, 6, 1);
        graph.insertEdges(5, 6, 1);

        graph.showGraph();

        System.out.println("深度优先遍历");
        graph.hasVisited = new boolean[len];
        graph.dfs();
        System.out.println("\n广度优先遍历");
        graph.hasVisited = new boolean[len];
        graph.bfs();
    }

    public GraphDemo(int num) {
        vertexList = new ArrayList<>(num);
        edges = new int[num][num];
        numOfEdges = 0;
    }

    /**
     * 获取边的个数
     *
     * @return
     */
    public int getNumOfEdges() {
        return numOfEdges;
    }

    /**
     * 获取顶点的个数
     *
     * @return
     */
    public int getNumOfVertex() {
        return vertexList.size();
    }

    /**
     * 获取权重
     *
     * @param v1
     * @param v2
     * @return
     */
    public int getWeight(int v1, int v2) {
        return edges[v1][v2];
    }

    /**
     * 通过下标获取值
     *
     * @param index
     * @return
     */
    public String getValueByIndex(int index) {
        return vertexList.get(index);
    }

    /**
     * 插入顶点
     *
     * @param vertex 顶点
     */
    public void insertVertex(String vertex) {
        vertexList.add(vertex);
    }

    /**
     * 插入边
     *
     * @param v1     顶点的下标
     * @param v2     顶点的下标
     * @param weight 权重
     */
    public void insertEdges(int v1, int v2, int weight) {
        edges[v1][v2] = weight;
        edges[v2][v1] = weight;
        numOfEdges++;
    }

    /**
     * 展示图
     */
    public void showGraph() {
        for (int[] row : edges) {
            System.err.println(Arrays.toString(row));
        }
    }

    /**
     * 获取第一个邻接矩阵的下标
     *
     * @param v1
     * @return
     */
    public int getFirstNeighbor(int v1) {
        int len = getNumOfVertex();
        for (int i = 0; i < len; i++) {
            if (edges[v1][i] > 0) {
                return i;
            }
        }
        return -1;
    }

    /**
     * 根据上一个邻接结点的下标来获取下一个邻接结点
     *
     * @param v1
     * @param v2
     * @return
     */
    public int getNextNeighbor(int v1, int v2) {
        int len = getNumOfVertex();
        for (int i = v2 + 1; i < len; i++) {
            if (edges[v1][i] > 0) {
                return i;
            }
        }
        return -1;
    }

    /**
     * 深度优先遍历
     * @param hasVisited
     * @param v1
     */
    public void dfs(boolean[] hasVisited, int v1) {
        System.out.print(" =>" + getValueByIndex(v1));
        hasVisited[v1] = true;
        int neighbor = getFirstNeighbor(v1);
        while (neighbor != -1) {
            if (!hasVisited[neighbor]) {
                dfs(hasVisited, neighbor);
            }
            neighbor = getNextNeighbor(v1, neighbor);
        }
    }

    public void dfs() {
        for (int i = 0; i < getNumOfVertex(); i++) {
            if (!hasVisited[i]) {
                dfs(hasVisited, i);
            }
        }
    }

    /**
     * 广度优先遍历
     * @param hasVisited
     * @param v1
     */
    public void bfs(boolean[] hasVisited, int v1) {
        int u;  //表示队列的头结点对应的下标
        int w; //邻接结点w
        LinkedList queue = new LinkedList();
        System.out.print(" =>" + getValueByIndex(v1));
        hasVisited[v1] = true;
        queue.addLast(v1);
        while (!queue.isEmpty()) {
            u = (Integer) queue.removeFirst();
            w = getFirstNeighbor(u);
            while (w != -1) {
                if (!hasVisited[w]) {
                    System.out.print(" =>" + getValueByIndex(w));
                    hasVisited[w] = true;
                    queue.addLast(w);
                }
                w = getNextNeighbor(u, w);
            }

        }
    }

    public void bfs() {
        int len = getNumOfVertex();
        for (int i = 0; i < len; i++) {
            if (!hasVisited[i]) {
                bfs(hasVisited, i);
            }
        }
    }

}