Pagini recente » Cod sursa (job #3161623) | Cod sursa (job #2637321) | Cod sursa (job #2344408) | Cod sursa (job #2779887) | Cod sursa (job #2887327)
#include <fstream>
#include <vector>
using namespace std;
const int NMAX = 1e5 + 10;
vector < int > v[NMAX];
bool viz[NMAX];
void dfs(int node) {
viz[node] = 1;
for (auto it : v[node]) {
if (viz[it]) continue;
dfs(it);
}
}
int main() {
ifstream f("dfs.in");
ofstream g("dfs.out");
int n, m;
f >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y;
f >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
f.close();
int comp = 0;
for (int i = 1; i <= n; i++) {
if (viz[i]) continue;
dfs(i);
comp++;
}
g << comp;
g.close();
return 0;
}