Cod sursa(job #3306777)
| Utilizator | Data | 13 august 2025 17:19:27 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
vector<int> g[100001];
bool viz[100001];
void DFS (int a) {
viz[a] = true;
for (auto i: g[a]) {
if(viz[i] == false) {
DFS(i);
}
}
}
int main() {
ifstream cin ("dfs.in");
ofstream cout ("dfs.out");
int n, m;
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
g[y].push_back(x);
}
int cnt = 0;
for (int i = 1; i <= n; ++i) {
if (viz[i] == false) {
DFS(i);
++cnt;
}
}
cout << cnt;
return 0;
}
