Cod sursa(job #3325502)
| Utilizator | Data | 25 noiembrie 2025 16:54:46 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 60 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
vector<vector<int>> G;
int viz[20000];
void dfs(int i) {
viz[i] = true;
for (int x : G[i]) {
if (!viz[x])
dfs(x);
}
}
int main() {
int n, m;
fin >> n >> m;
G.resize(n + 1);
for (int i = 1; i <= m; i++) {
int x, y;
fin >> x >> y;
G[x].push_back(y);
G[y].push_back(x);
}
int sol = 0;
for (int i = 1; i <= n; i++) {
if (!viz[i]) {
sol++;
dfs(i);
}
}
fout << sol;
return 0;
}
