Pagini recente » Cod sursa (job #725073) | Cod sursa (job #2716238) | Cod sursa (job #824189) | Cod sursa (job #22980) | Cod sursa (job #2574805)
#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]){
dfs(y);
}
}
}
int main()
{
int n,m,x,y,ans=0;
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>x>>y;
adauga(x,y);
adauga(y,x);
}
for(int i=1;i<=n;i++){
if(viz[i]==0){
ans++;
dfs(i);
}
}
cout<<ans;
return 0;
}