Pagini recente » Cod sursa (job #321613) | Cod sursa (job #165195) | Cod sursa (job #2836532) | Cod sursa (job #1576062) | Cod sursa (job #2759772)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("dfs.in");
ofstream fout("dfs.out");
const int dim=100009;
int n,m,ans;
bool vizitat[dim];
vector<int>v[dim];
void dfs(int nod){
vizitat[nod]=1;
for(int i=0;i<v[nod].size();i++)
if(!vizitat[v[nod][i]]){
dfs(v[nod][i]);
}
}
int32_t main()
{
cin>>n>>m;
for(int i=1;i<=m;i++){
int x,y;
cin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(!vizitat[i]){
dfs(i);
ans++;
}
cout<<ans;
}