常用概念
![[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-l5zPYczu-1647435194678)(C:\Users\许正\AppData\Roaming\Typora\typora-user-images\image-20220316201217284.png)]](https://i-blog.csdnimg.cn/blog_migrate/0732516d5ede6130dae3a42c244ad946.png)
![[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-0P11Wqyf-1647435194679)(C:\Users\许正\AppData\Roaming\Typora\typora-user-images\image-20220316201239274.png)]](https://i-blog.csdnimg.cn/blog_migrate/8514c6f36db8f004166fce91e5c40415.png)
表示方式
![[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-2n1ScZgm-1647435194680)(C:\Users\许正\AppData\Roaming\Typora\typora-user-images\image-20220316201332514.png)]](https://i-blog.csdnimg.cn/blog_migrate/a1137c0165b899cb65401ce8800a678f.png)
![[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-r1IjXUuq-1647435194681)(C:\Users\许正\AppData\Roaming\Typora\typora-user-images\image-20220316201451661.png)]](https://i-blog.csdnimg.cn/blog_migrate/5cc0f294957b7377c6d06cbb7e3f464f.png)
图遍历
图的深度优先遍历
![[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-SeIeacDS-1647435194682)(C:\Users\许正\AppData\Roaming\Typora\typora-user-images\image-20220316202904389.png)]](https://i-blog.csdnimg.cn/blog_migrate/7681f4155c668968f2bf0013b3acc6a8.png)
算法步骤
![[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-2PdC0rnk-1647435194682)(C:\Users\许正\AppData\Roaming\Typora\typora-user-images\image-20220316203122456.png)]](https://i-blog.csdnimg.cn/blog_migrate/6c509e059e3bb4784b4403f7e804cbd5.png)
图的深度优先遍历及算法步骤
![[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-5g1OHPfp-1647435194682)(C:\Users\许正\AppData\Roaming\Typora\typora-user-images\image-20220316204456303.png)]](https://i-blog.csdnimg.cn/blog_migrate/c3a214522a65cc4a4d806a608bba9b5e.png)
代码实现
package com.xz.graph;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
public class Graph {
private ArrayList<String> vertexList;
private int[][] edges;
private int numOfEdges;
private boolean[] isVisited;
public static void main(String[] args) {
int n = 8;
String Vertexs[] = {"1", "2", "3", "4", "5", "6", "7", "8"};
Graph graph = new Graph(n);
for (String vertex : Vertexs) {
graph.insertVertex(vertex);
}
graph.insertEdge(0, 1, 1);
graph.insertEdge(0, 2, 1);
graph.insertEdge(1, 3, 1);
graph.insertEdge(1, 4, 1);
graph.insertEdge(3, 7, 1);
graph.insertEdge(4, 7, 1);
graph.insertEdge(2, 5, 1);
graph.insertEdge(2, 6, 1);
graph.insertEdge(5, 6, 1);
graph.showGraph();
System.out.println("深度遍历");
graph.dfs();
System.out.println("广度优先!");
graph.bfs();
}
public Graph(int n) {
edges = new int[n][n];
vertexList = new ArrayList<String>(n);
numOfEdges = 0;
}
public int getFirstNeighbor(int index) {
for (int j = 0; j < vertexList.size(); j++) {
if (edges[index][j] > 0) {
return j;
}
}
return -1;
}
public int getNextNeighbor(int v1, int v2) {
for (int j = v2 + 1; j < vertexList.size(); j++) {
if (edges[v1][j] > 0) {
return j;
}
}
return -1;
}
private void dfs(boolean[] isVisited, int i) {
System.out.print(getValueByIndex(i) + "->");
isVisited[i] = true;
int w = getFirstNeighbor(i);
while (w != -1) {
if (!isVisited[w]) {
dfs(isVisited, w);
}
w = getNextNeighbor(i, w);
}
}
public void dfs() {
isVisited = new boolean[vertexList.size()];
for (int i = 0; i < getNumOfVertex(); i++) {
if (!isVisited[i]) {
dfs(isVisited, i);
}
}
}
private void bfs(boolean[] isVisited, int i) {
int u;
int w;
LinkedList queue = new LinkedList();
System.out.print(getValueByIndex(i) + "=>");
isVisited[i] = true;
queue.addLast(i);
while (!queue.isEmpty()) {
u = (Integer) queue.removeFirst();
w = getFirstNeighbor(u);
while (w != -1) {
if (!isVisited[w]) {
System.out.print(getValueByIndex(w) + "=>");
isVisited[w] = true;
queue.addLast(w);
}
w = getNextNeighbor(u, w);
}
}
}
public void bfs() {
isVisited = new boolean[vertexList.size()];
for (int i = 0; i < getNumOfVertex(); i++) {
if (!isVisited[i]) {
bfs(isVisited, i);
}
}
}
public int getNumOfVertex() {
return vertexList.size();
}
public void showGraph() {
for (int[] link : edges) {
System.err.println(Arrays.toString(link));
}
}
public int getNumOfEdges() {
return numOfEdges;
}
public String getValueByIndex(int i) {
return vertexList.get(i);
}
public int getWeight(int v1, int v2) {
return edges[v1][v2];
}
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;
numOfEdges++;
}
}