Pagini recente » Cod sursa (job #2917334) | Cod sursa (job #31842) | Cod sursa (job #2961406) | Cod sursa (job #659186) | Cod sursa (job #2491061)
#include<fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int VM=100001;
int vf[2*VM],urm[2*VM],lst[VM],nr,ct;
bool viz[VM];
void adaug(int x,int y)
{
vf[++nr]=y;
urm[nr]=lst[x];
lst[x]=nr;
}
void dfs(int x)
{
viz[x]=true;
int y;
for(int p=lst[x];p!=0;p=urm[p])
{
y=vf[p];
if(!viz[y])
{
dfs(y);
}
}
}
int main()
{
int n,m;
fin>>n>>m;
for(int i=0;i<m;i++)
{
int x,y;
fin>>x>>y;
adaug(x,y);
adaug(y,x);
}
fin.close();
for(int i=1;i<=n;i++)
{
if(!viz[i])
{
ct++;
dfs(i);
}
}
fout<<ct;
fout.close();
return 0;
}