Cod sursa(job #3316115)
| Utilizator | Data | 17 octombrie 2025 14:32:39 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <vector>
using namespace std;
const int NMAX = 1e5;
vector<int> G[NMAX + 1];
bool vis[NMAX + 1];
void dfs(int node) {
vis[node] = 1;
for (auto vecin: G[node]) {
if(!vis[vecin]) dfs(vecin);
}
}
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int main() {
int n, m;
fin >> 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 cc = 0;
for (int i = 1; i<= n; i++) {
if(!vis[i]) {
cc++;
dfs(i);
}
}
fout << cc;
}
