Pagini recente » Cod sursa (job #2163716) | Cod sursa (job #3172163) | Cod sursa (job #721975) | Borderou de evaluare (job #663669) | Cod sursa (job #238324)
Cod sursa(job #238324)
#include<stdlib.h>
#include<stdio.h>
#define nmax 100003
int *a[nmax];
int sz,n,m,viz[nmax];
void bfs(int x)
{
int list[nmax]={0};
int e,v,i;
e=v=0;
list[e]=x;
while (e<=v)
{
x=list[e++];
for (i=1;i<=a[x][0];i++)
if (!viz[a[x][i]])
{
list[++v]=a[x][i];
viz[a[x][i]]=1;
}
}
}
int main()
{
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
int i,x,y;
scanf("%d %d",&n,&m);
for (i=1;i<=n;i++)
{
a[i]=(int *)realloc(a[i],sizeof(int));
a[i][0]=0;
}
for (i=1;i<=m;i++)
{
scanf("%d %d",&x,&y);
a[x][0]++;
a[x]=(int *)realloc(a[x],(a[x][0]+1)*sizeof(int));
a[x][a[x][0]]=y;
a[y][0]++;
a[y]=(int *)realloc(a[y],(a[y][0]+1)*sizeof(int));
a[y][a[y][0]]=x;
}
for (i=1;i<=n;i++)
{
if (!viz[i])
{
++sz;
bfs(i);
}
}
printf("%d\n",sz);
return 0;
}