[JAVA/백준] SW 역량 테스트 준비-기초 | 브루트 포스: 외판원 순회 2

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
import java.util.Scanner;

/**
 * @author HEESOO
 *
 */
public class Main {
	static int n;
	static int[][] w;
	static boolean[] visit;
	static int min=Integer.MAX_VALUE;
	public static void dfs(int start, int depart, int depth, int sum) {
		if(depth==n && start==depart) {
			sum+=w[depart][start];
			min=Math.min(min, sum);
			return;
		}
		for(int j=0;j<n;j++) {
			if(w[depart][j]==0||visit[j]) continue;
			visit[j]=true;
			dfs(start, j, depth+1, sum+w[depart][j]);
			visit[j]=false;
		}
	}
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scan = new Scanner(System.in);
		n=scan.nextInt();
		w=new int[n][n];
		visit=new boolean[n];
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
				w[i][j]=scan.nextInt();
		
		for(int i=0;i<n;i++)
			dfs(i,i,0,0);
		
		System.out.println(min);
	}
}