[DFS] baekjoon-10971

Author: Seogeurim

README.md

@@ -24,6 +24,7 @@
 | 05  |     | [Baekjoon-15658 연산자 끼워넣기 (2)](./src/DFS/P15658) |      |
 | 06  |     | [Baekjoon-9095 1, 2, 3 더하기](./src/DFS/P9095) |      |
 | 07  |     | [Baekjoon-14501 퇴사](./src/DFS/P14501) |      |
+| 08  |     | [Baekjoon-10971 외판원 순회 2](./src/DFS/P10971) |      |
 
 ### BFS
 

src/DFS/P10971/Main.java

@@ -0,0 +1,50 @@
+package DFS.P10971;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+
+    static int N;
+    static int[][] W;
+
+    static boolean[] visited;
+    static int min = Integer.MAX_VALUE;
+
+    public static void main(String[] args) throws Exception {
+        System.setIn(new FileInputStream("src/DFS/P10971/input.txt"));
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+
+        N = Integer.parseInt(br.readLine());
+        W = new int[N][N];
+
+        for (int i = 0; i < N; i++) {
+            StringTokenizer st = new StringTokenizer(br.readLine());
+            for (int j = 0; j < N; j++) {
+                W[i][j] = Integer.parseInt(st.nextToken());
+            }
+        }
+
+        visited = new boolean[N];
+        for (int i = 0; i < N; i++) {
+            solve(i, i, 0, 0);
+        }
+
+        System.out.println(min);
+    }
+
+    static void solve(int start, int from, int count, int sum) {
+        if (count == N && start == from) {
+            min = Math.min(min, sum);
+            return;
+        }
+
+        for (int to = 0; to < N; to++) {
+            if (!visited[to] && W[from][to] != 0) {
+                visited[to] = true;
+                solve(start, to, count + 1, sum + W[from][to]);
+                visited[to] = false;
+            }
+        }
+    }
+}

src/DFS/P10971/README.md

@@ -0,0 +1,3 @@
+## [baekjoon-10971] 외판원 순회 2
+
+![image](https://user-images.githubusercontent.com/22045163/94675648-040d0e00-0355-11eb-8ae9-ac6673464fa5.png)

src/DFS/P10971/input.txt

@@ -0,0 +1,5 @@
+4
+0 10 15 20
+5 0 9 10
+6 13 0 12
+8 8 9 0