9.图及其应用

一、基本介绍

1.为什么要有图

2.举例说明

3.常用概念

二、图的表示方式

1.邻接矩阵

2.邻接表

三、深度优先遍历

1.介绍

2.基本思想

3.算法步骤

四、广度优先遍历

1.基本思想

2.算法步骤

3.算法图示

五、代码实现

public class Graph {
    private ArrayList<String> vertexList;
    private int[][] edges;
    private int numberOfEdges;
    private boolean[] isVisited;

    public static void main(String[] args) {
        int n = 5;
    }

    public Graph(int n) {
        edges = new int[n][n];
        vertexList = new ArrayList<>();
        numberOfEdges = 0;
        isVisited = new boolean[n];
    }

    public int getFirstNeighber(int index) {
        for (int j = 0; j < vertexList.size(); j++) {
            if (edges[index][j] > 0) {
                return j;
            }
        }
        return -1;
    }

    public int getNextNeighber(int v1, int v2) {
        for (int j = v2 + 1; j < vertexList.size(); j++) {
            if (edges[v1][j] > 0) {
                return j;
            }
        }
        return -1;
    }

    public void dfs(boolean[] isVisited, int i) {
        System.out.println(getValueByIndex(i));
        isVisited[i] = true;
        int w = getFirstNeighber(i);
        while (w != -1) {
            if (!isVisited[w]) {
                dfs(isVisited, w);
            }
            w = getNextNeighber(i, w);
        }
    }

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

    public void bfs(boolean[] isVisited, int i) {
        int u;
        int w;
        LinkedList queue = new LinkedList();
        System.out.println(getValueByIndex(i));
        isVisited[i] = true;
        queue.addLast(i);
        while (!queue.isEmpty()) {
            u = (Integer) queue.removeFirst();
            w = getFirstNeighber(u);
            while (w != -1) {
                if (!isVisited[w]) {
                    System.out.println(getValueByIndex(w));
                    isVisited[w] = true;
                    queue.addLast(w);
                }
                w = getNextNeighber(u, w);
            }

        }
    }

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

    public void insertVertex(String vertex) {
        vertexList.add(vertex);
    }

    public void insertEdge(int v1, int v2, int weight) {
        edges[v1][v2] = weight;
        edges[v2][v1] = weight;
        numberOfEdges++;
    }

    public int getNumberOfVertex() {
        return vertexList.size();
    }

    public int getNumberOfEdges() {
        return numberOfEdges;
    }

    public String getValueByIndex(int i) {
        return vertexList.get(i);
    }

    public int getWeight(int v1, int v2) {
        return edges[v1][v2];
    }

    public void showGraph() {
        for (int[] link : edges) {
            System.out.println(Arrays.toString(link));
        }
    }
}

rn edges[v1][v2];
}

public void showGraph() {
    for (int[] link : edges) {
        System.out.println(Arrays.toString(link));
    }
}

}