深搜图

package aha;

import java.util.Scanner;

public class shensoutu {
	static int []book=new int [1000];
	static int e[][]=new int [1000][1000];
	static int sum;
	static int n;
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		 n=sc.nextInt();
		int m=sc.nextInt();
		for(int i=1;i<=n;i++){
			for(int k=1;k<=n;k++){
				if(i==k){
					e[i][k]=0;
				}
				else{
					e[i][k]=99999;
				}
			}
		}
		for(int i=1;i<=m;i++){
			int a=sc.nextInt();
			int b=sc.nextInt();
			e[a][b]=1;
			e[b][a]=1;
		}
		
		book[1]=1;
		dfs(1);
	}
	private static void dfs(int cur) {
		System.out.println(cur);
		sum++;
		if(sum==n)return;
	    for(int i=1;i<=n;i++){
	    	if(e[cur][i]==1&&book[i]==0){
	    		book[i]=1;
	    		dfs(i);
	    	}
	    }
	}

}