[SWEA] 최장 경로

 

 

[문제]

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV7GOPPaAeMDFAXB

SW Expert Academy

 

 

 

[소스 코드]

import java.util.*;
import java.io.*;
public class Solution {
	static int n,result;
	static boolean[][] edge;
	static boolean[] visit;
	public static void main(String[] args) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		int T = Integer.parseInt(br.readLine());
		for(int tc=1;tc<=T;tc++) {
			st = new StringTokenizer(br.readLine());
			n = Integer.parseInt(st.nextToken());
			int m = Integer.parseInt(st.nextToken());
			visit = new boolean[n+1];
			edge = new boolean[n+1][n+1];
			result = 0;
			for(int i=0;i<m;i++) {
				st = new StringTokenizer(br.readLine());
				int x = Integer.parseInt(st.nextToken());
				int y = Integer.parseInt(st.nextToken());
				edge[x][y] = edge[y][x] = true;
			}
			for(int i=1;i<=n;i++) {
				visit[i] = true;
				dfs(i,1);
				visit[i] = false;
			}
			System.out.println("#"+tc+" "+result);
		}
	}
	private static void dfs(int idx,int dis) {
		for(int i=1;i<=n;i++) {
			if(!visit[i] && edge[i][idx]) {
				visit[i] = true;
				dfs(i,dis+1);
				visit[i] = false;
			}
		}
		result = Math.max(result, dis);
	}
}