Pagini recente » Cod sursa (job #878732) | Cod sursa (job #749708) | Cod sursa (job #1264305) | Cod sursa (job #1356124) | Cod sursa (job #1623450)
#include<fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,nr,vf[200001],lst[100001],urm[200001];
bool viz[10001];
void adauga(int x,int y)
{
nr++;
vf[nr]=y;
urm[nr]=lst[x];
lst[x]=nr;
}
void dfs(int x)
{
int p=lst[x],y;
viz[x]=true;
while(p!=0)
{
y=vf[p];
viz[y]=true;
p=urm[p];
}
}
int main()
{
int i,x,y,nr=0;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
adauga(x,y);
adauga(y,x);
}
for(i=1;i<=n;i++)
{
if(!viz[i])
{
dfs(i);
nr++;
}
}
g<<nr;
return 0;
}