Pagini recente » Cod sursa (job #847444) | Borderou de evaluare (job #1551189) | Cod sursa (job #1865433) | Cod sursa (job #949048) | Cod sursa (job #263337)
Cod sursa(job #263337)
#include<fstream.h>
#define xn 100000
ifstream fin("dfs.in");
ofstream fout("dfs.out");
struct lista{ int nod; lista *urm;} *g[xn];
int n,m,viz[xn],nr;
void df(int i)
{
viz[i]=nr;
lista *p;
for(p=g[i];p;p=p->urm)
if(!viz[p->nod])
df(p->nod);
}
int main()
{
int i,x,y;
lista *p;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
p=new lista;
p->nod=y;
p->urm=g[x];
g[x]=p;
}
for(i=1;i<=n;i++)
if(!viz[i])
nr++,df(i);
fout<<nr<<'\n';
fout.close();
return 0;
}