邻接矩阵实现图的广搜和深搜(java模板）

经常要用到,放到这里备用!!

Java代码

1. //邻接矩阵实现图的广搜和深搜
2. import java.util.*;
4. public class Graph {
6. private int[][] G;//邻接矩阵
7. private int k;//顶点数目
8. private boolean[] visited;//判断顶点是否被访问过
10. public Graph(int k,int[][] G){
11. this.k=k;
12. this.G=G;
13. visited = new boolean[k];
14. }
16. public static void main(String[] args) {
17. Scanner sc = new Scanner(System.in);
18. int k;
19. k = sc.nextInt(); //顶点数(顶点为0,1,2,...k-1)
20. int m=sc.nextInt();//边数
22. //构建邻接矩阵
23. int[][] G = new int[k][k];
24. for (int i = 0; i <m; i++) {
25. int u = sc.nextInt();
26. int v = sc.nextInt();
27. G[u][v] = 1;
28. G[v][u] = 1;//无向图的对称
29. }
30. Graph g=new Graph(k,G);
31. g.bfs(0);
32. // g.dfs(0);
33. System.out.println();
34. }
36. //广搜
37. private void bfs(int v) {
38. //队列用来保存被访问节点的分支节点
39. Queue<Integer> que = new LinkedList<Integer>();
40. que.offer(v);
41. while (!que.isEmpty()) {
42. v = que.poll();
43. System.out.print(v+" ");
44. visited[v] = true;
45. //将被访问节点的分支节点加入到队列中
46. for (int i = 0; i < k; i++) {
47. if (G[v][i] == 1 && !visited[i]) {
48. que.add(i);
49. visited[i] = true;
50. }
51. }
52. }
53. }
55. //深搜
56. private void dfs(int v) {
57. visited[v] = true;
58. System.out.print(v+" ");
59. for (int i = 0; i <k; i++) {
60. //递归调用搜索没有被访问过的当前节点的下一个节点(邻接点)
61. if (G[v][i] == 1 && !visited[i])
62. dfs(i);
63. }
64. }
66. }