Cod sursa(job #2979504)
| Utilizator | Data | 15 februarie 2023 11:28:22 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<vector<int>> v;
vector<bool> viz;
void dfs(int nod) {
viz[nod] = true;
for(auto x : v[nod]) {
if(!viz[x]) {
dfs(x);
}
}
}
int main() {
int n, m; fin >> n >> m;
v.resize(n+5);
viz.resize(n+5);
for(int i = 1; i <= m; i++) {
int x, y; fin >> x >> y;
v[x].emplace_back(y);
v[y].emplace_back(x);
}
int nr = 0;
for(int i = 1; i <= n; i++) {
if(!viz[i]) {
dfs(i);
nr++;
}
}
fout << nr;
return 0;
}
