Pagini recente » Cod sursa (job #2802398) | Cod sursa (job #1082800) | Cod sursa (job #2739990) | Cod sursa (job #3246281) | Cod sursa (job #204761)
Cod sursa(job #204761)
#include<stdio.h>
#define Nmax 100005
struct nod{int vec;nod* next;};
typedef nod* list;
list a[Nmax];
char viz[Nmax];
void adauga(int x,int y){
list aux = new nod;
aux->vec=y;
aux->next=a[x];
a[x]=aux;
}
void dfs(int i){
for(list p = a[i];p;p=p->next)
if(viz[p->vec]==0){
viz[p->vec]=1;
dfs(p->vec);
}
}
int main(){
FILE *fin = fopen("dfs.in","r");
FILE *fout=fopen("dfs.out","w");
int N,M;
fscanf(fin,"%d%d",&N,&M);
for(int i=1;i<=M;i++){
int x,y;
fscanf(fin,"%d%d",&x,&y);
adauga(x,y);
adauga(y,x);
}
int cc=0;
for(int i=1;i<=N;i++)
if(viz[i]==0){
cc++;
dfs(i);
}
fprintf(fout,"%d\n",cc);
fclose(fin);
fclose(fout);
return 0;
}