Pagini recente » Cod sursa (job #1478143) | Cod sursa (job #714696) | Cod sursa (job #2697981) | Cod sursa (job #1430781) | Cod sursa (job #248954)
Cod sursa(job #248954)
#include<fstream.h>
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int a[100][100],j,n,viz[100],sol[100],x,y,kappa,m,k=1;
void dfs(int x)
{ int i;
viz[x]=kappa;
sol[k++]=x;
for(i=1;i<=n;i++)
if(a[i][x]&&!viz[i])
dfs(i);
}
int main()
{ int i;
fin>>n>>m;
for(i=1;i<=m;i++)
{ fin>>x>>y;
a[x][y]=a[y][x]=1;
}
for(i=1;i<=n;i++)
{ if(!viz[i])
{ kappa++;
dfs(i);
/*for(j=1;j<k;j++)
fout<<sol[j]<<' ';
fout<<'\n';*/
k=1;
}
}
fout<<kappa<<'\n';
return 0;
}