Pagini recente » Cod sursa (job #1390992) | Cod sursa (job #1898800) | Cod sursa (job #2307639) | Cod sursa (job #446512) | Cod sursa (job #2042868)
#include<fstream>
#include<set>
#include<iostream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,x,y,conexe;
int viz[100003];
set<int> v[100003];
set<int>::iterator it;
void afis()
{
int nn;
cin>>nn;
int ii;
for(ii=1;ii<=n;ii++) cout<<viz[ii]<<' ';
cout<<'\n';
}
void dfs(int k)
{
set<int>::iterator itt;
int xx;
//afis();
viz[k]=1;//afis();
for(itt=v[k].begin();itt!=v[k].end();++itt)
{
xx=*itt;
if(viz[xx]==0) dfs(xx);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
v[x].insert(y);
v[y].insert(x);
}
for(int i=1;i<=n;++i)
if(viz[i]==0)
{
conexe++;
dfs(i);
}
g<<conexe<<'\n';
f.close();
g.close();
return 0;
}