Pagini recente » Cod sursa (job #853556) | Cod sursa (job #3340052) | Cod sursa (job #1376808) | Cod sursa (job #3321622) | Cod sursa (job #3335371)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("infoarena_dfs.in");
ofstream fout("infoarena_dfs.out");
vector<vector<int>> listaVecini;
vector<int> viz;
void dfs(int i){
viz[i] = 1;
for (auto j : listaVecini[i]) {
if (viz[j] == 0)
dfs(j);
}
}
int main(){
int n, m;
fin >> n >> m;
listaVecini.assign(n+1, {});
viz.assign(n+1, 0);
for(int i = 0; i < m; i++){
int x, y;
fin >> x >> y;
listaVecini[x].push_back(y);
listaVecini[y].push_back(x);
}
int contor = 0;
for(int i = 1; i <= n; i++){
if(viz[i] == 0){
contor ++;
dfs(i);
}
}
fout << contor;
return 0;
}