图的遍历(广度和深度)

Java代码

1. //深度优先遍历****************************************************
2. class Graph1 { //以邻接矩阵存储的图类
4. protected int n; //图的节点个数
5. protected int mat[][];// 二维数组存储图的邻接矩阵
6. protected int visited[];//访问标记数组
8. public Graph1(int m1[][]){
9. n = m1.length;
10. mat = new int [n][n];
11. System.arraycopy(m1, 0, mat, 0, n); //System类方法，复制数组
12. visited= new int [n];
13. }
14. public Graph1(){
15. }
16. public void depthFirstSearch(){//图的深度优先遍历
17. System.out.println("深度优先遍历Depth first search：");
18. for(int k=1;k<=n;k++){
19. depthfs(k);
20. System.out.println();
21. unvisited();
22. }
23. }
24. private void unvisited() {
25. int i;
26. for(i = 0;i<visited.length;i++){
27. visited[i]=0;
28. }
29. }
30. private void depthfs(int k) {//从节点k开始的深度优先遍历
31. int i,j=0;
32. System.out.print(" v"+k+"->");
33. i = k - 1;
34. visited[i]=1;
35. while(j<n){
36. if(mat[i][j]==1 && visited[j]==0){
37. depthfs(j+1);
38. }else {
39. j++;
40. }
41. }
42. }
43. }
44. public class testGraph1{
45. public static void main(String ag[]){
46. int mat[][]= {{0,1,0,0},{0,0,1,1},{0,0,0,0},{1,0,1,0}};
47. Graph1 g1 = new Graph1(mat);
48. g1.depthFirstSearch();
49. }
50. }