Pagini recente » Cod sursa (job #509856) | Cod sursa (job #1780294) | Cod sursa (job #726165) | Cod sursa (job #2110653) | Cod sursa (job #2574785)
#include <fstream>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
int vf[400005], urm [400005], lst[100005], nr;
bool viz[200005];
void adauga(int x, int y){
vf[++nr]=y;
urm[nr]=lst[x];
lst[x]=nr;
}
void dfs(int x){
viz[x]=true;
for(int p=lst[x]; p!=0; p=urm[p]){
int y=vf[p];
if(viz[y]==0){
dfs(y);
}
}
}
int main()
{
int n,m,x,y,ans=0;
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>x>>y;
adauga(x,y);
adauga(y,x);
}
for(int i=1;i<=n;i++){
if(viz[i]==0){
dfs(i);
ans++;
}
}
cout<<ans;
return 0;
}