Pagini recente » Cod sursa (job #2095507) | Cod sursa (job #200149) | Cod sursa (job #1617161) | Cod sursa (job #109721) | Cod sursa (job #3217468)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<int> vecini[100001];
int n, m, ncc;
bool vizitat[100001];
void citire(){
int i, x, y;
for(i = 1; i <= m; ++i){
fin >> x >> y;
vecini[x].push_back(y);
vecini[y].push_back(x);
}
}
void dfs(int nod){
vizitat[nod] = true;
for(int i : vecini[nod])
if(!vizitat[i])
dfs(i);
}
int main(){
int i;
fin >> n >> m;
citire();
for(i = 1; i <= n; ++i)
if(!vizitat[i]){
ncc++;
dfs(i);
}
fout << ncc;
return 0;
}