数据结构实验之图论二：图的深度遍历-java代码

import java.util.Scanner;

public class Main {

    public static int[] visit = new int[1000];
    public static int[][] map = new int[1000][1000];

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int T = input.nextInt();
        for (int x = 0; x < T; x++) {
            int n = input.nextInt(), m = input.nextInt();
            for (int i = 0; i <n; i++) {
                for(int j=0;j<n;j++)
                map[i][j] = 0;
                visit[i] = 0;
            }
            for (int i = 0; i < m; i++) {
                int a = input.nextInt();
                int b = input.nextInt();
                map[a][b] = map[b][a] = 1;
            }
            System.out.print(0);
            DFS(0, n);
            System.out.println();
        }
    }

    public static void DFS(int temp, int m) {
        visit[temp] = 1;
        for (int i = 0; i <m; i++) {
            if (visit[i] == 0 && map[temp][i] == 1) {
                System.out.print(" " + i);
                DFS(i, m);
            }
        }
    }
}