Pagini recente » Cod sursa (job #2559135) | Cod sursa (job #2759275) | Istoria paginii runda/christmas_time/clasament | Cod sursa (job #11410) | Cod sursa (job #3142982)
//https://www.infoarena.ro/problema/dfs
#include <bits/stdc++.h>
using namespace std;
int n,m,x,y, V[100100], nrg;
vector<int> G[200200];
void dfs(int s){
if(V[s]){
return;
}
V[s] = 1;
for(int i=0; i<G[s].size(); i++){
dfs(G[s][i]);
}
}
int main(){
ifstream cin("dfs.in");
ofstream cout("dfs.out");
cin >> n >> m;
for(int i=1; i<=m; i++){
cin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
}
for(int i=1; i<=n; i++){
if(V[i] == 0){
nrg++;
dfs(i);
}
}
cout << nrg;
}