Open jmkkk opened 7 years ago
import java.io.FileInputStream; import java.util.Scanner;
/ 알고리즘 : DFS 경로 표시 / public class JmTest002 { static int T; static int V; static int E; static int [][] adj; static int [] visited;
public static void main(String[] args) throws Exception{ System.setIn(new FileInputStream("JmTest002.txt")); Scanner sc = new Scanner(System.in); T = sc.nextInt(); for(int tc=1; tc<=T; tc++) { V = sc.nextInt(); E = sc.nextInt(); adj = new int [V+1][V+1]; visited = new int [V+1]; for(int i=1; i<=E; i++) { int n1 = sc.nextInt(); int n2 = sc.nextInt(); adj[n1][n2] = 1; } sc.close(); dfs(1); } } public static void dfs(int n) { visited[n] = 1; System.out.print(n + " "); for(int i=1; i<=V; i++) { if(adj[n][i] == 1 && visited[i] == 0) { dfs(i); } } }
}
1 5 6 1 2 1 3 3 2 3 4 2 5 5 4
import java.io.FileInputStream; import java.util.Scanner;
/ 알고리즘 : DFS 경로 표시 / public class JmTest002 { static int T; static int V; static int E; static int [][] adj; static int [] visited;
}