Pagini recente » Cod sursa (job #2456603) | Cod sursa (job #1574500) | Cod sursa (job #556397) | Cod sursa (job #2181509) | Cod sursa (job #2667698)
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int maxNr = 100005;
bool viz[maxNr];
vector<int> v[maxNr];
void dfs(int nod){
viz[nod]=1;
for(auto it: v[nod])
if(!viz[it])
dfs(it);
}
int main(){
int n,m;
ifstream f("dfs.in");
cin >> n >>m;
for(int i=0;i<m;i++){
int x,y;
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
f.close();
int nrCompConexe=0;
for(int i=1;i<=n;i++){
if(!viz[i]){
nrCompConexe++;
dfs(i);
i--;
}
}
cout << nrCompConexe;
ofstream g("dfs.out");
g << nrCompConexe;
g.close();
//linux output debug.
cout << '\n';
return 0;
}