Pagini recente » tema | Cod sursa (job #783111) | Cod sursa (job #993510) | Cod sursa (job #1425954) | Cod sursa (job #2125954)
import java.io.*;
import java.lang.*;
import java.util.*;
public class Main {
static Scanner fi;
static PrintWriter fo;
static Vector<Integer>[] graph;
static boolean[] f;
static int n, m;
static void dfs(int u) {
f[u] = true;
for (int v: graph[u])
if (!f[v])
dfs(v);
}
public static void main(String[] args) throws IOException {
int a, b, answer;
fi = new Scanner(new FileInputStream("dfs.in"));
fo = new PrintWriter("dfs.out");
n = fi.nextInt();
m = fi.nextInt();
f = new boolean[n + 5];
graph = new Vector[n + 5];
for (int i = 1; i <= n; ++i)
graph[i] = new Vector<>();
for (int i = 0; i < m; ++i) {
a = fi.nextInt();
b = fi.nextInt();
graph[a].add(b);
graph[b].add(a);
}
answer = 0;
for (int i = 1; i <= n; ++i) {
if (!f[i]) {
answer += 1;
dfs(i);
}
}
fo.print(answer);
fi.close();
fo.close();
}
}