Pagini recente » Cod sursa (job #130711) | Cod sursa (job #2235956) | Cod sursa (job #195524) | Cod sursa (job #2666726) | Cod sursa (job #1697006)
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#define N 100010
using namespace std;
std::vector<int> muc[N];
int verif[N],grad[N];
void parg(int c){
int i;
for(i=0;i<grad[c];i++){
if(verif[ muc[c][i] ]==0){
verif[muc[c][i]]=1;
parg(muc[c][i]);
}
}
}
int main(){
int i,n,m;
int x,y,nrcomp=0;
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=0;i<m;i++){
scanf("%d%d",&x,&y);
muc[x].push_back(y);
muc[y].push_back(x);
grad[x]++;
grad[y]++;
}
for(i=1;i<=n;i++){
if(verif[i]==0){
verif[i]=1;
parg(i);
nrcomp++;
}
}
printf("%d",nrcomp);
return 0;
}