Pagini recente » Cod sursa (job #1858004) | Cod sursa (job #2551639) | Cod sursa (job #1522246) | Cod sursa (job #194004) | Cod sursa (job #2238533)
#include <cstdio>
using namespace std;
const int NMAX = 100001;
bool viz[NMAX];
int n;
struct nod
{
int x;
nod *urm;
};
nod *v[NMAX];
void add(int vf, int x) {
nod *q = new nod;
q->x = x;
q->urm = v[vf];
v[vf] = q;
}
void dfs(int x) {
viz[x] = 1;
nod *p;
for(p = v[x]; p != NULL; p = p->urm)
if(!viz[p->x]) dfs(p->x);
}
int main()
{
freopen("dfs.in", "r", stdin);
freopen("dfs.out", "w", stdout);
int m, x, y, comp = 0;
scanf("%i %i", &n, &m);
while(m--) {
scanf("%i %i", &x, &y);
add(x, y);
add(y, x);
}
for(int i = 1; i <= n; i++)
if(!viz[i]) {
comp++;
dfs(i);
}
printf("%i", comp);
return 0;
}