Pagini recente » Cod sursa (job #2034127) | Cod sursa (job #1242692) | Cod sursa (job #2848261) | Cod sursa (job #1463745) | Cod sursa (job #188096)
Cod sursa(job #188096)
#include<fstream.h>
#define max 2000
ifstream f("dfs.in");
ofstream g("dfs.out");
int viz[max],a[max][max],cont,n,m,i,x,y,nr[max];
void dfs(int k)
{ int i;
if(viz[k])
return;
viz[k]=cont;
for(i=1;i<=nr[k];i++)
if(!viz[a[k][i]])
dfs(a[k][i]);
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x;
f>>y;
a[x][++nr[x]]=y;
a[y][++nr[y]]=x;
}
for(i=1;i<=n;i++)
if(!viz[i])
{
cont++;
dfs(i);
}
g<<cont;
f.close();
g.close();
return 0;
}