Pagini recente » Cod sursa (job #439803) | Cod sursa (job #474621) | Cod sursa (job #2454215) | Cod sursa (job #481299) | Cod sursa (job #1705373)
import java.io.*;
import java.util.*;
public class Main {
static ArrayList<Integer> [] adj;
static int[] visited ;
public static void dfs(int n) {
visited[n] = 1;
for (Integer x : adj[n])
if (visited[x] != 1)
dfs(x);
}
public static void main(String[] args) throws IOException {
BufferedReader bf = new BufferedReader(new FileReader("dfs.in"));
PrintStream out = new PrintStream(new FileOutputStream("dfs.out"));
String tmp[] = bf.readLine().split(" ");
int n = Integer.parseInt(tmp[0]);
int m = Integer.parseInt(tmp[1]);
adj = new ArrayList[n+1];
for(int i=1;i<=n;i++)
adj[i] = new ArrayList<Integer>();
for (int i = 0; i < m; i++) {
tmp = bf.readLine().split(" ");
int x = Integer.parseInt(tmp[0]);
int y = Integer.parseInt(tmp[1]);
adj[x].add(y);
adj[y].add(x);
}
visited = new int[n + 1];
int comp = 0;
for (int i = 1; i <= n ; i++)
if (visited[i] != 1){
comp++;
dfs(i);
}
out.println(comp);
out.close();
bf.close();
}
}