Pagini recente » Cod sursa (job #2659898) | Cod sursa (job #292351) | Cod sursa (job #463042) | Cod sursa (job #2674105) | Cod sursa (job #2373790)
#include <bits/stdc++.h>
using namespace std;
#define LMAX 100005
int n;
bool viz[LMAX];
vector<int> G[LMAX];
void dfs(int nod){
viz[nod]=1;
for(auto it : G[nod])
if(!viz[it])
dfs(it);
}
int main(){
freopen("dfs.in","r",stdin);
freopen("dfs.out","w",stdout);
int m;
scanf("%d %d",&n,&m);
for(int i=1;i<=m;++i){
int from,to;
scanf("%d %d",&from,&to);
G[from].push_back(to);
G[to].push_back(from);
}
int nr_comp=0;
for(int i=1;i<=n;++i)
if(!viz[i]){
++nr_comp;
dfs(i);
}
printf("%d\n",nr_comp);
return 0;
}