Pagini recente » Cod sursa (job #2484404) | Cod sursa (job #1130388) | Cod sursa (job #1976422) | Cod sursa (job #808005) | Cod sursa (job #1649366)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m,a[100001],b[100001],i,j,suc[100001],pred[100001],st[100001],x,y,nrc=1,c[22001][22001];
void citire()
{
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
c[x][y]=1;
c[y][x]=1;
}
}
void df_r1(int nod)
{
int k;
suc[nod]=nrc;
for(k=1;k<=n;k++)
{
if(c[nod][k] && suc[k]==0)
df_r1(k);
}
}
void df_r2(int nod)
{
int k;
pred[nod]=nrc;
for(k=1;k<=n;k++)
{
if(c[k][nod] && pred[k]==0)
df_r2(k);
}
}
int main()
{
citire();
nrc=1;
for(i=1;i<=n;i++)
if(suc[i]==0)
{
suc[i]=nrc;
df_r1(i);
df_r2(i);
for(j=1;j<=n;j++)
if(pred[j]!=suc[j])
{
suc[j]=0;
pred[j]=0;
}
nrc++;
}
/*for(i=1;i<nrc;i++)
{
cout<<"Componenta "<<i<<endl;
for(j=1;j<=n;j++)
if(suc[j]==i)
cout<<j<<" ";
cout<<endl;
}*/
fout<<nrc-1;
return 0;
}