[Data Structure][JAVA]DFS, BFS 구현
DFS(Deepth - Frist - Search): 깊이 우선 탐색 import java.util.LinkedList; import java.util.Queue; public class Main { public static boolean[] visited = new boolean[9]; public static int[][] graph = {{}, {2,3,8},{1,7},{1,4,5},{3,5},{3,4},{7},{2,6,8},{1,7}}; public static void dfs(int x) { visited[x] = true; System.out.print(x + " "); for(int i = 0; i < graph[x].length; i++) { int y = graph[x][i]; if(!v..
2023. 6. 26.